ppxscal/embedding_network huggingface dataset:
Community-driven ontology construction in social networking portals
Authors: Anna V. Zhdanova
Venue: Web Intelligence and Agent Systems (2008)

The goal of the work presented here is to introduce community-driven ontology management as a new approach to ontology construction and demonstrate the added value to community portals of being community driven. The three main parts of the work are (i) the development of a framework allowing and motivating collaborative ontology construction and reuse for the end users (a person or a community), (ii) building a prototype on the basis of this specification, namely the People's portal, and (iii) the application of the developed infrastructure to scenarios in semantically-enhanced community portals with the involvement of real users. The development of the framework for community-driven ontology construction is aimed at enriching the established practices for ontology development and population with community-supporting features. The objective of community-driven ontology management is to provide the means and motivations for a large number of users to &ldquo;weave&rdquo; and adopt the Semantic Web. The People's portal infrastructure allows end users to define the content structure (i.e., develop ontologies), to populate ontologies, and to define the ways in which the content is managed on various semantically-enhanced community portals where the infrastructure is applied. An analysis of the functionalities of existing (Semantic) Web community environments and the empirical results obtained in this work are indicative of its feasibility and of the advantages of community-driven ontology construction. In practice, the communities were capable of introducing on the community portals such ontology items as Classes, Subclasses, Properties, Instances, ontology mappings, and of reusing these items afterwards.
Integrating Mobile Applications into RFID Based B2B Systems
Authors: Tudor Cerlinca, Cristina Turcu, Marius Cerlinca
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper presents the principles governing the design and development of a mobile application, as well as various aspects regarding its integration into a more complex RFID_B2B (Radio Frequency Identification - Business to Business) system. Extending the applicability of RFID_B2B systems represents the main goal of such applications, which are generally expected to handle large amount of data, to operate in stand-alone mode and to allow their easy integration into complex RFID_B2B systems. The paper proposes new solutions and ideas regarding the design and development of a secure and very fast method for the communication and synchronization between the B2B servers and a mobile application running on various mobile devices.
Densification arising from sampling fixed graphs
Authors: Pedram Pedarsani, Daniel R. Figueiredo, Matthias Grossglauser
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer networks. A recently observed feature is known as network densification, which occurs when the number of edges grows much faster than the number of nodes, as the network evolves over time. This surprising phenomenon has been empirically validated in a variety of networks that emerge in the real world and mathematical models have been recently proposed to explain it. Leveraging on how real data is usually gathered and used, we propose a new model called Edge Sampling to explain how densification can arise. Our model is innovative, as we consider a fixed underlying graph and a process that discovers this graph by probabilistically sampling its edges. We show that this model possesses several interesting features, in particular, that edges and nodes discovered can exhibit densification. Moreover, when the node degree of the fixed underlying graph follows a heavy-tailed distribution, we show that the Edge Sampling model can yield power law densification, establishing an approximate relationship between the degree exponent and the densification exponent. The theoretical findings are supported by numerical evaluations of the model. Finally, we apply our model to real network data to evaluate its performance on capturing the previously observed densification. Our results indicate that edge sampling is indeed a plausible alternative explanation for the densification phenomenon that has been recently observed.
Combining workflow and PDM based on the workflow management coalition and STEP standards: the case of axalant
Authors: K. Rouibah, S. Rouibah, W. M. P. Van Der Aalst
Venue: International Journal of Computer Integrated Manufacturing (2007)

Product data management (PDM) current technology has several pitfalls such as lack of compliance of workflow modules to standards as well as lack of interoperability between these systems. This paper illustrates the extension of the current workflow management system part of the PDM system axalant to support engineering processes management. The extension was based on an analysis of the workflow management coalition and STEP standards and, through the extension described in the paper, now axalant complies with these standards. Because of this it is now possible to exchange workflow data with existing workflow systems on the market. In this paper the two standards are analysed, the required workflow architecture is specified, and the resulting implementation is described. The necessary enhancements include the extension of the data model of axalant, the modification of the corresponding software, the modification of the user interface and the link to the interface between axalant and ProView, which helps to generate graphical process definitions. Major achievements consist of the enhancement of process design through the creation of building blocks (split-and join-operations) as well as the enhancement of organizational structure through the usage of roles as a resource for process activities. Moreover, the paper adds flexibility for axalant to handle changes, and axalant is able to generate workflow templates and ad-hoc processes and to communicate with external workflow systems.
Generation, modeling, and analysis of CCII-based gyrators using the generalized symbolic framework for linear active circuits
Authors: Ramy A. Saad, Ahmed M. Soliman
Venue: International Journal of Circuit Theory and Applications (2008)

In this paper, CCII-based gyrators are synthesized, modeled, and analyzed using the generalized symbolic framework for linear active circuits. The systematic synthesis method using admittance matrix expansion, included in the framework, is applied to generate optimized nullor&ndash;mirror descriptions for the gyrator. The resulting CCII-based circuit representations for the gyrators, obtained from mapping nullor&ndash;mirror pairs in the ideal realizations with equivalent second-generation current conveyors (CCIIs), can be classified into two topologies according to the type of the CCII terminals handling the gyrator input and output signals. In topology I, the gyrator input and output terminals are CCIIs Y&ndash;Z-terminals, whereas in topology II, the gyrator input and output terminals are CCIIs X-terminals. The parasitic components within the synthesized circuits, associated with the actual CCIIs, are modeled and included in their expanded admittance matrices. Exact non-ideal analysis for two circuits belonging to the two topologies, involving the reduction of their expanded admittance matrices to port admittance matrices, is then carried out to investigate the practical functional performance for these circuits at their ports. The non-ideal performance analysis based on the CCII actual parasitic elements indicates that, from a practical perspective, the CCII-based gyrator circuits belonging to topology I are more efficient and suitable for the gyrator applications than those belonging to topology II in terms of bandwidth and operation at high frequencies. SPICE simulations are included to demonstrate the analytical results for the comparison between the practical performances of the two circuit topologies. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A cointegration analysis of price transmission between ADRs and dually listed South Korean stocks
Authors: Lee K. Lim
Venue: Mathematics and Computers in Simulation (2008)

This paper examines the dynamics of price transmissions between the South Korean shares and its American Depository Receipts (ADRs) for individual firms and a portfolio of all firms using a vector autoregressive (VAR) model in a cointegration framework. The results show a long-run cointegrating relationship among five pricing factors, namely the prices of Korean ADRs and their underlying shares, the Korean and the United States (US) market indices, and the exchange rate. Although the US market index is in the cointegrating vector, it is found to be an exogenous variable in the long-run. The short-term dynamics of the Korean portfolio returns are influenced by the deviation from the long-run equilibrium and the lagged changes of all pricing factors except for the exchange rate. On the other hand, its ADR portfolio returns are influenced by lags of its own returns, the US market return and changes in exchange rate. While innovations in the price of underlying shares explain a large portion of innovations in the ADRs for individual firms, shocks to the Korean and the US markets are more important at the aggregate level.
Approximating the traffic grooming problem
Authors: Michele Flammini, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks
Venue: Journal of Discrete Algorithms (2008)

The problem of grooming is central in studies of optical networks. In graph-theoretic terms, this can be viewed as assigning colors to the lightpaths so that at most g of them (g being the grooming factor) can share one edge. The cost of a coloring is the number of optical switches (ADMs); each lightpath uses two ADMs, one at each endpoint, and in case g lightpaths of the same wavelength enter through the same edge to one node, they can all use the same ADM (thus saving g-1 ADMs). The goal is to minimize the total number of ADMs. This problem was shown to be NP-complete for g=1 and for a general g. Exact solutions are known for some specific cases, and approximation algorithms for certain topologies exist for g=1. We present an approximation algorithm for this problem. For every value of g the running time of the algorithm is polynomial in the input size, and its approximation ratio for a wide variety of network topologies-including the ring topology-is shown to be 2lng+o(lng). This is the first approximation algorithm for the grooming problem with a general grooming factor g.
Proteomic Analysis of a Response to Long-Chain Fatty Acid in Escherichia coli and Its Application
Authors: Mee-Jung Han, Jeong Wook Lee, Sang Yup Lee, Jong Shin Yoo
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

A long-chain fatty acid is a regulatory signal that modulates gene expression. In this study, proteomic studies that compared global translational differences between Escherichia coli cells grown in the presence of exogenous glucose and oleic acid were examined by two-dimensional gel electrophoresis (2-DE) and tandem mass spectrometry (LC-MS/MS). Of about 40 proteins showing altered expression levels with the presence of oleic acid, 10 including AldA, AceA, FadA, FadB, FadL, MalE, RbsB, Udp, Cdd and YccU were newly synthesized. Among them, the promoter of aldehyde dehydrogenase A (aldA promoter) was used for the production of a recombinant protein. Analysis of fluorescence intensities and confocal microscopic imaging revealed that aldA promoter is a very good promoter in that it is tightly controlled and highly expressed with active form compared with IPTG-inducible promoter. Thus the aldA promoter induced by oleic acid may be useful for achieving high-level expression of genes in E. coli.
The acyclic edge chromatic number of a random d-regular graph is d&thinsp;+&thinsp;1
Authors: Jaroslav Nešetřil, Nicholas C. Wormald
Venue: Journal of Graph Theory (2005)

We prove the theorem from the title: the acyclic edge chromatic number of a random d-regular graph is asymptotically almost surely equal to d&thinsp;+&thinsp;1. This improves a result of Alon, Sudakov, and Zaks and presents further support for a conjecture that &Delta;(G)&thinsp;+&thinsp;2 is the bound for the acyclic edge chromatic number of any graph G. It also represents an analog of a result of Robinson and the second author on edge chromatic number. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 69&ndash;74, 2005 AMS classification: 05C15 (primary: graph coloring) 68R05 (secondary: combinatorics).
An Ion Transformation Approach for De Novo Peptide Sequencing via Tandem Mass Spectra
Authors: Changyong Yu, Guoren Wang, Yi Zhao, Wendan Zhai
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

De novo peptide sequencing is especially useful in theidentification of unknown proteins. A class of efficient modelson de novo peptide interpretation have been proposedrecently based on graph theory. However, majority of thegraph-based models convert each peak to multiple nodes inthe graph due to unknown ion types. This directly resultsin the decrease of the efficiency and accuracy of peptide sequencingalgorithms. To solve these problems, in this paperan ion transformation method is proposed to convert all theother type of ions to b-ions before the construction of spectrumgraph in the peptide sequencing. Experiments on boththe real QTof MS/MS data and the synthetic MS/MS datademonstrate that the proposed method reduces the size ofthe graph and improves the efficiency and accuracy of peptidesequencing algorithms.
Power-gating-aware high-level synthesis
Authors: Eunjoo Choi, Changsik Shin, Taewhan Kim, Youngsoo Shin
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

A problem inherent in designing power-gated circuits is the overhead of the state-retention storage required to preserve the circuit state in standby mode. Reducing the amount of retention storage is known to be the most influential factor in minimizing the loss of the benefit (i.e. power saving) by power-gating. In this paper, we address a new problem of high-level synthesis with the objective of minimizing the size of retention storage to be used in the power-gated circuits. Specifically, we propose a complete design framework, called HLS-pg, that starts from the power-gating-aware scheduling, allocation, and controller synthesis down to the final circuit layout. The key contribution of the work is to solve the power-gating-aware scheduling problem, namely, scheduling operations that minimizes the number of retention registers required at the power-gating control step, while satisfying resource and latency constraints. In experiments on benchmark designs implemented in 65-nm CMOS technology, HLS-pg generates circuits with 27% less leakage current, with 6% less circuit area and wirelength, compared to the power-gated circuits produced by conventional highlevel synthesis.
A 3GPP system architecture evolution virtualized experimentation infrastructure for mobility prototyping
Authors: Miguel Gómez Rodríguez, Fermín Galán Márquez, Emilio J. Torres Mateos
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

The 3GPP System Architecture Evolution (SAE) is a very attractive environment from the service provisioning perspective, thanks to the variety of access technologies and mobility features introduced. In such a diverse environment, experimentation infrastructures (i.e., testbeds) become a key instrument for telecom operators, since mobility solutions and service behavior in their presence need to be validated under the different possible configurations from early development stages. However, the complexity of 3GPP SAE scenarios hinders conventional testbeds from adhering to cost-effectiveness and business-oriented criteria, due to the high infrastructure and operational costs involved. In order to overcome these limitations, this paper proposes an experimentation infrastructure that, based on combining virtualization techniques with several of the available open source IMS and mobility toolkits, allows the easy creation and deployment of complex 3GPP SAE network emulation scenarios while minimizing the associated expenditures.
A Static Java Birthmark Based on Operand Stack Behaviors
Authors: Heewan Park, Hyun-il Lim, Seokwoo Choi, Taisook Han
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

A software birthmark means the inherent characteristics of a program that can be used to identify the program. By means of comparing the birthmarks of programs, the fact of the software theft can be detected. In this paper, a static Java birthmark is proposed by utilizing a set of behaviors as the characteristics of the Java applications. A behavior denotes a sequence of bytecodes which share their operands through the operand stack. We evaluate the proposed birthmark with respect to two properties required for birthmark, i.e., credibility and resilience. The empirical results show that the proposed birthmark is credible and resilient to program transformation. Therefore, the proposed birthmark can be used for identifying the software's originality.
Polymorphic Arrays: A Novel VLSI Layout For Systolic Computers
Authors: A. Fiat
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

This paper proposes a novel architecture for massively parallel systolic computers, which is based on results from lattice theory. In the proposed architecture, each processor is connected to four other processors via constant-lenght wires in an regular borderless pattern. The mapping of processes to processors is continuous, and the architecture guarantees exceptional load uniformity for rectangular process arrays of arbitrary sizes. In addition, no timesharing is ever required when the ration of processes to processors is smaller than 1//spl radic/5.
Scalable QoS Content-Aware Load Balancing Algorithm for a Web Switch Based on Classical Policies
Authors: Katja Gilly, Nigel Thomas, Carlos Juiz, Ramon Puigjaner
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

This paper presents a load balancing solution for a cluster of web servers that considers QoS in order to differentiate the service provided to the clients when the web system is receiving a high volume of traffic. Adaptability is a needed feature to suit the balancing parameters to the fluctuations of the web traffic. We monitor the incoming workload to the system and tune the parameters more frequently when the bursty arrivals trend increases. Throughput prediction enables to estimate the maximum utilization allowed in the servers for each service, and then to set a maximum number of accepted requests to set a limit in the utilization of the servers and to avoid a possible congestion situation, while guaranteeing the QoS. Classical dispatching policies are introduced and compared to analyse the behaviour of the algorithm. HTTP static and dynamic requests are considered in the workload.
An efficient methodology for modeling complex computer codes with Gaussian processes
Authors: Amandine Marrel, Bertrand Iooss, François Van Dorpe, Elena Volkova
Venue: Computational Statistics Data Analysis (2008)

Complex computer codes are often too time expensive to be directly used to perform uncertainty propagation studies, global sensitivity analysis or to solve optimization problems. A well known and widely used method to circumvent this inconvenience consists in replacing the complex computer code by a reduced model, called a metamodel, or a response surface that represents the computer code and requires acceptable calculation time. One particular class of metamodels is studied: the Gaussian process model that is characterized by its mean and covariance functions. A specific estimation procedure is developed to adjust a Gaussian process model in complex cases (non-linear relations, highly dispersed or discontinuous output, high-dimensional input, inadequate sampling designs, etc.). The efficiency of this algorithm is compared to the efficiency of other existing algorithms on an analytical test case. The proposed methodology is also illustrated for the case of a complex hydrogeological computer code, simulating radionuclide transport in groundwater.
Scheduling strategies for optimistic parallel execution of irregular programs
Authors: Milind Kulkarni, Patrick Carribault, Keshav Pingali, Ganesh Ramanarayanan, Bruce Walter, Kavita Bala, L. Paul Chew
Venue: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (2008)

Recent application studies have shown that many irregular applications have a generalized data parallelism that manifests itself as iterative computations over worklists of different kinds. In general, there are complex dependencies between iterations. These dependencies cannot be elucidated statically because they depend on the inputs to the program; thus, optimistic parallel execution is the only tractable approach to parallelizing these applications. We have built a system called Galois that supports this style of parallel execution. Its main features are (i) set iterators for expressing worklist-based data parallelism, and (ii) a runtime system that performs optimistic parallelization of these iterators, detecting conflicts and rolling back computations as needed. Our work builds on the Galois system, and it addresses the problem of scheduling iterations of set iterators on multiple cores. The policy used by the base Galois system is to assign an iteration to a core whenever it needs work to do, but we show in this paper that this policy is not optimal for many applications. We also argue that OpenMP-style DO-ALL loop scheduling directives such as chunked and guided self-scheduling are too simplistic for irregular programs. These difficulties led us to develop a general scheduling framework for irregular problems; OpenMP-style scheduling strategies are special cases of this general approach. We also provide hooks into our framework, allowing the programmer to leverage application knowledge to further tune a schedule for a particular application. To evaluate this framework, we implemented it as an extension of the Galois system. We then tested the system using five real-world, irregular, data-parallel applications. Our results show that (i) the optimal scheduling policy can be different for different applications and often leverages application-specific knowledge and (ii) implementing these schedules in the Galois system is relatively straightforward.