ppxscal/embedding_network huggingface dataset:
Research Process Support with Organizational Flow in e-Science
Authors: Dukyun Nam, June H. Lee, Soonwook Hwang, Young-Kyoon Suh, Byungsang Kim
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

To utilize an e-Science application service which is built on a grid computing environment efficiently, it is vital to develop technologies for integrating each e-Science application service into a workflow and to execute the workflow in a cooperative environment. In this paper, the required workflow in e-Science is analyzed using a conceptual scenario and categorized into three types of workflows: simulations, experiments, and collaborative work. Additionally, the workflow of the aerospace research community, an e-Science environment is shown. The necessary applications and functionalities for the required workflow are then proposed.
Creating realistic, scenario-based synthetic data for test and evaluation of information analytics software
Authors: Mark A. Whiting, Jereme Haack, Carrie Varley
Venue: Proceedings of the 2008 conference on BEyond time and errors: novel evaLuation methods for Information Visualization (2008)

We describe the Threat Stream Generator, a method and a toolset for creating realistic, synthetic test data for information analytics applications. Finding or creating useful test data sets is difficult for a team focused on creating solutions to information analysis problems. First, real data that might be considered good for testing analytic applications may not be available or may be classified. In the latter case, tool builders will not have the clearances needed to use, or even see, the data. Second, analysts' time is scarce and obtaining the needed characteristics of real data from them to create a test data set is difficult. Finally, generating good test data is challenging. Commercial data generators are focused on large database testing, not information analytics tool testing. Our distinctive contribution is that we embed known ground truth in a test data set, so that tool developers and others will be able to determine the effectiveness of their software and how they are progressing in their support for information analysts. Our automated methods also significantly decrease data set development time. We review our approach to scenario development, threat insertion strategies, data set development, and data set evaluation. We also discuss our recent successes in using our data in open analytic competitions.
Enabling Interoperability among Meta-Schedulers
Authors: Norman Bobroff, Liana Fong, Selim Kalayci, Yanbin Liu, Juan Carlos Martinez, Ivan Rodero, S. Masoud Sadjadi, David Villegas
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Grid computing supports shared access to computing resources from cooperating organizations or institutes in the form of virtual organizations. Resource brokering middleware, commonly known as a meta-scheduler or a resource broker, matches jobs to distributed resources. Recent advances in meta-scheduling capabilities are extended to enable resource matching across multiple virtual organiza-tions. Several architectures have been proposed for interoperating meta-scheduling systems. This paper presents a hybrid approach, combining hierarchical and peer-to-peer architectures for flexibility and extensibility of these systems. A set of protocols are introduced to allow different meta-scheduler instances to communicate over Web Services. Interoperability between three heterogeneous and distributed organizations (namely, BSC, FIU, and IBM), each using different meta-scheduling technologies, is demonstrated under these protocols and resource models.
Navigating in Webs of Trust: Finding Short Trust Chains in Unstructured Networks without Global Knowledge
Authors: Jens-Uwe Buβer, Steffen Fries, Martin Otto, Peter Hartmann
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Authentication of participants is fundamental for secure communication systems. Many traditional systems rely on central components (like certification authorities). These have to be powerful and well-protected, making them expensive, and require trust in a central authority. Conventional decentralized solutions based on local trust between participants only (like PGP) are cheaper but either must be supported by central components, or they are prone to e.g. Sybil attacks. We present a decentralized solution without any trusted central components for finding paths of trust between arbitrary participants in an unstructured network: In an initialization phase a hierarchical overlay structure is constructed, providing each participant with certificate chains to predefined reference nodes. These certificate chains can be used later to find short trust chains between nodes. Monte-Carlo simulations clearly demonstrate the feasibility and efficiency of our approach for social networks. Further features like merging of networks, limited trust relationships between participants and revocation of trust can be integrated easily.
Transactional memory for smalltalk
Authors: Lukas Renggli, Oscar Nierstrasz
Venue: Proceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 2007 (2007)

Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexity and potentially hard-to-detect bugs to the application. Transactional memory is an attractive mechanism that does not have the drawbacks of locks, however the underlying implementation is often difficult to integrate into an existing language. In this paper we show how we have introduced transactional semantics in Smalltalk by using the reflective facilities of the language. Our approach is based on method annotations, incremental parse tree transformations and an optimistic commit protocol. We report on a practical case study, benchmarks and further and on-going work.
Inferring Connectivity of Genetic Regulatory Networks Using Information-Theoretic Criteria
Authors: Wentao Zhao, Erchin Serpedin, Edward R. Dougherty
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2008)

Recently, the concept of mutual information has been proposed for infering the structure of genetic regulatory networks from gene expression profiling. After analyzing the limitations of mutual information in inferring the gene-to-gene interactions, this paper introduces the concept of conditional mutual information and based on it proposes two novel algorithms to infer the connectivity structure of genetic regulatory networks. One of the proposed algorithms exhibits a better accuracy while the other algorithm excels in simplicity and flexibility. By exploiting the mutual information and conditional mutual information, a practical metric is also proposed to assess the likeliness of direct connectivity between genes. This novel metric resolves a common limitation associated with the current inference algorithms, namely the situations where the gene connectivity is established in terms of the dichotomy of being either connected or disconnected. Based on the data sets generated by synthetic networks, the performance of the proposed algorithms is compared favorably relative to existing state-of-the-art schemes. The proposed algorithms are also applied on realistic biological measurements, such as the cutaneous melanoma data set, and biological meaningful results are inferred.
Max-Min Fair Scheduling in Input-Queued Switches
Authors: Madhusudan Hosaagrahara, Harish Sethu
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of certain kinds of denial-of-service attacks, and serve as a critical component of a quality-of-service strategy to achieve certain guaranteed services such as delay bounds and minimum bandwidths. In this paper, we choose a popular notion of fairness called max-min fairness and provide a rigorous definition in the context of input-queued switches. We show that being fair at the output ports alone, or at the input ports alone, or even at both input and output ports, does not actually achieve overall max-min fair allocation of bandwidth in a switch. Instead, we propose a new algorithm that computes the exact max-min fair allocation of rates for the flows through the switch. In addition to proving the correctness of the algorithm, we show that it can be implemented in a distributed fashion at the input and output ports to determine the max-min fair rates. We further propose a practical scheduling strategy based on our algorithm and present simulation results, using both real traffic traces as well synthetic traffic, to evaluate the fairness of a variety of popular scheduling algorithms for input-queued switches. The results show that our scheduling strategy achieves better fairness than other known algorithms for input-queued switches and, in addition, achieves throughput performance very close to that of the best schedulers.
Interval-valued fuzzy numbers and concordance analysis approach to the operational organization type selection
Authors: Ming-Miin Yu, Jing-Shing Yao
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

In this paper the concordance analysis method is applied to evaluate the candidate alternatives of operational organization types. To avoid the complex process in estimating the weight of sensitivity analysis and considering decision-makers' opinions in the fuzzy sense, this research develops a fuzzy concordance analysis method to choose the most suitable operational organization type. Tao-Yuan's rapid transit system is an example for studying the outranking relationships among operational organization types. The results are of primary importance in providing decision makers with a good reference under complex and uncertain circumstances.
Security education: a roadmap to the future
Authors: Carol Taylor, Rose Shumba
Venue: ACM SIGCSE Bulletin (2008)

The topic of this proposed special session is security education with an emphasis on increasing the number of schools and programs that teach it. We will review the current status of security education as it is taught within the CS discipline including funding, curriculum standards and government programs. We will also address misconceptions people may have regarding teaching security and how these views hinder the development of programs and curriculum. Another area we cover which we feel is critical to increasing participation in security education is resources for teaching security including existing curriculum, expert assistance from Centers of Excellence schools and other resources. The format of the session will consist of both presentation periods with at least half the session devoted to participant question and answer. Session participants will be encouraged to share experiences and common concerns to the benefit of everyone attending.
Social web applications in the city: a lightweight infrastructure for urban computing
Authors: Frank Allan Hansen, Kaj Grønbæk
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

In this paper, we describe an infrastructure for browsing and multimedia blogging of Web-based information anchored with physical places in an urban environment. The infrastructure is generic in the sense that it may use any means such as GPS, RFID or 2D-barcodes as ubiquitous links anchors to anchor Web-based information, blogs, and services in the physical environment. The infrastructure is inspired from earlier work on open hypermedia, in the sense that the anchoring and blogging functionality can be integrated to augment arbitrary Web sites providing information that is relevant to places or objects in the physical world. The blog and anchor functionality is implemented as a set of Web services running on a server external to the content server. Experiences and design issues from three cases are discussed, which use Semacode-based physical anchoring to support lightweight urban Web applications.
Analyzing static and dynamic write margin for nanometer SRAMs
Authors: Jiajing Wang, Satyanand Nalam, Benton H. Calhoun
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

This paper analyzes write ability for SRAM cells in deeply scaled technologies, focusing on the relationship between static and dynamic write margin metrics. Reliability has become a major concern for SRAM designs in modern technologies. Both local mismatch and scaled VDD degrade read stability and write ability. Several static approaches, including traditional SNM, BL margin, and the N-curve method, can be used to measure static write margin. However, static approaches cannot indicate the impact of dynamic dependencies on cell stability. We propose to analyze dynamic write ability by considering the write operation as a noise event that we analyze using dynamic stability criteria. We also define dynamic write ability as the critical pulse width for a write. By using this dynamic criterion, we evaluate the existing static write margin metrics at normal and scaled supply voltages and assess their limitations. The dynamic write time metric can also be used to improve the accuracy of VCCmin estimation for active VDD scaling designs.
Middleware support for protecting personal data from web based data services
Authors: Ravi Chandra Jammalamadaka
Venue: Proceedings of the 4th on Middleware doctoral symposium (2007)

Web based data services are very popular with the average computer user. Examples of such services include Gmail.com, Yahoo Photos, Yahoo Briefcase and Amazon S3 Service. The user outsources personal data to such services. Such services have many advantages which include: a) Mobile access: The data can be accessed from any computer connected to the internet; b) Availability: the data is available 24/7; c) Good service: Typically such services employ experts who provide a quality service. However, such a model does raise some fundamental questions concerning data privacy and security. The data is stored in plaintext at the service provider and is vulnerable to data theft from disgruntled employees and internet thieves. This paper describes our research in designing middleware architectures that secure personal data using cryptographic techniques before it is outsourced to the service provider. Care is taken such that service provider can continue to provide data services on secured data. We describe the challenges in designing and implementing such middleware architectures, a summary of our past work and the future directions that we intend to take.
Multi-modal presentation of medical histories
Authors: Catalina Hallett
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

This paper describes a visualisation architecture that integrates graphical devices and natural language in a cooperative system for navigating through complex images of medical histories. We show how the addition of automatically generated natural language can be used to improve the usability of a graphical user interface and conversely how the graphical user interface can be used to specify the content of user customizable medical reports.
Polyimide microcantilever surface stress sensor using low-cost, rapidly-interchangeable, spring-loaded microprobe connections
Authors: R. H. Ibbotson, R. J. Dunn, V. Djakov, P. Ko Ferrigno, S. E. Huq
Venue: Microelectronic Engineering (2008)

We present the fabrication of a polyimide microcantilever array with integrated gold piezoresistive strain gauges and a thick SU-8 backing for use as a surface stress sensor. The selected polyimide's low Young's modulus (1.8GPa) theoretically results in a high sensitivity to changes in surface stress. Electroplated gold contact pads, 1.5@mm thick, provide a stable, repeatable surface onto which electrical connections to the fabricated device are made using spring-loaded microprobes. The piezoresistors are found to have a gauge factor of between 4 and 4.5 and a sensitivity to surface stress of 2.1x10^-^4(N/m)^-^1.
Modeling and Simulation of Paralleled Series-Loaded-Resonant Converter
Authors: Alejandro Polleri, Taufik, Makbul Anwari
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper presents the development of a circuit modeling for paralleled Series Loaded Resonant (SLR) converter used in an experimental power supply to drive high voltage and high frequency medical equipment. The circuit model for each individual converter is first described. Once the complete model of an individual converter is achieved, the model is then extended to include the parallel connection. To verify the validity of model, the design of paralleled SLR using the model is explained. The component values obtained are then being used in Pspice simulations to further prove the validity of the model.
Niche graphs and mixed pair graphs of tournaments
Authors: Steve Bowser, Charles Cable, Richard Lundgren
Venue: Journal of Graph Theory (1999)

In our efforts to study the niche graph of a tournament T, we have found it easier to study the complement, which we call the &ldquo;mixed pair&rdquo; graph of T and denote MP(T). We show that an undirected graph G is MP(T), for some tournament T, if and only if G is one of the following: a cycle of odd order, a path of even order, a forest of odd order consisting of two paths, a forest of even order consisting of three paths, or a forest of four or more paths. (In this description, we consider an isolated vertex to be a path.) &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 319&ndash;332, 1999
Analytic and bootstrap approximations of prediction errors under a multivariate Fay-Herriot model
Authors: W. González-Manteiga, M. J. Lombardía, I. Molina, D. Morales, L. Santamaría
Venue: Computational Statistics Data Analysis (2008)

The prediction of vectors of small area quantities based on a multivariate Fay-Herriot model is addressed. For this, an empirical best linear unbiased predictor (EBLUP) of the target vector is used, where the model parameters are estimated by two different methods based on moments. The mean cross product error matrix of the multidimensional EBLUP is approximated both analytically and by a wild bootstrap method that yields direct and bias-corrected bootstrap estimators. A simulation study compares the small sample properties of the bootstrap estimators and the analytical approximation, including a comparison under lack of normality. Finally, the number of replicates needed for the bootstrap procedures to get stabilized are studied.
Failure Semantics in a SOA Environment
Authors: Chris Hobbs, Hanane Becha, Daniel Amyot
Venue: Proceedings of the 2008 International MCETECH Conference on e-Technologies (2008)

In a Service-Oriented Architecture (SOA), services publish descriptions to permit their composition into larger services. There are however serious gaps in the semantics of such service descriptions and these hinder the adoption of SOAs in mission-critical applications. This paper identifies some of these lacunae and proposes a foundation for resolving one of them—service failure. The technique of crash-only failure is proposed as a useful first step and we illustrate how it is particularly applicable to web services in a SOA.
Task Mapping in Heterogeneous MPSoCs for System Level Design
Authors: Kugan Vivekanandarajah, Santhosh Kumar Pilakkat
Venue: Proceedings of the 13th IEEE International Conference on on Engineering of Complex Computer Systems (2008)

This paper investigates automatic mapping of application-to-architecture in heterogeneous Multi Processor System on a Chip (MPSoC), a key problem in system level design of embedded systems. An algorithm is proposed to optimally solve this application-to-architecture mapping problem. The proposed algorithm uses efficient branch-and-bound approach to partition the problem into sub problems and solves them. In addition, we also propose simple heuristics for generating good initial solution and bounds such that the convergence of branch and bound algorithm is fast. Our experiments with randomly generated benchmarks show that the proposed algorithm is efficient and able to map the application-to-architecture with less number of branching.
Equivalent language models that closely simulate one another and their illustration in terms of L systems
Authors: Alexander Meduna, Martin svec, Tomás Kopecek
Venue: International Journal of Computer Mathematics (2007)

In this paper, we discuss equivalent formal language models that yield their words in a similar way and conceptualize this similarity. More specifically, if for two models, there is a substitution by which we change each string of every yield sequence in one model so that the sequence of strings resulting from this change represents a yield sequence in the other equivalent model, these two models closely simulate one another; otherwise, they do not. First, we formalize this concept of close simulation in equivalent formal language models in general. Then, we illustrate this concept in terms of EIL systems.
Rainfall sensitivity analyses for the HSB sounder: an Amazon case study
Authors: W. F. A. Lima, L. A. T. Machado, C. A. Morales, N. Viltard
Venue: International Journal of Remote Sensing (2007)

This work examines the sensitivity of the different channels of the HSB (Humidity Sensor for Brazil), on board the AQUA satellite, for the purpose of retrieving surface rainfall over land. The analysis is carried out in two steps: (a) a theoretical study performed using two radiative transfer models, RTTOV and the so-called Eddington method; and (b) the determination of the correlation between coincident measurements of HSB brightness temperatures and radar rainfall estimates during the DRY-TO-WET/AMC/LBA field campaign held in the Amazon region during September and October 2002. Theoretical results indicate the sensitivity of the HSB to water vapour content and cloud liquid water in the precipitation estimation. Theoretical and experimental analyses show that the channels 150 and 183±7 GHz are more adapted to estimate precipitation than the 183±1 and 183±3 GHz channels. The simulation analyses clearly show a hierarchy in physical effects that determine the brightness temperature of these channels. The rain and ice scattering dominate over the absorption of liquid water, and the liquid water absorption effect dominates over the absorption of water vapour. The results show that the 150 and 183±7 channels are more sensitive to the variation of liquid water and ice than the 183±1 and 183±3 channels. For the precipitation estimation using these channels, it was found that it is best adapted to the low precipitation rate situations, since the brightness temperature is rapidly saturated in the presence of high intense precipitation. A case study to estimate precipitation using the radar data has shown that it is possible to adjust a curve that relates the precipitation rate to the brightness temperature of the 150 GHz channel with a good level of accuracy for low precipitation rates.