ppxscal/embedding_network huggingface dataset:
A Dynamic Services Discovery Framework for Traversing Web Services Representation Chain
Authors: Liang-Jie Zhang, Qun Zhou, Tian Chao
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

In this paper, we propose a dynamic servicediscovery framework from Web services representationchain. The major components include Web ServiceChains Pre-categorizing module, Service ExplorationEngine, Services Container, Chain Change Detectionmodule with associated control parameters. From theworking research prototype, our proposed mechanismenables businesses to easily retrieve up-to-date Webservices linked and nested multi-level deep in the servicedescription documents. In addition, a federated Webservices discovery portal is illustrated to show how theresearch results are aggregated from hyperlinked WSILdocuments as well as UDDI registries for achievingmore accurate services exploration result.
By Reason and Authority: A System for Authorization of Proof-Carrying Code
Authors: Nathan Whitehead, Martin Abadi, George Necula
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

We present a system, BLF, that combines an authorizationlogic based on the Binder language with a logicalframework, LF, able to express semantic properties of programs.BLF is a general system for specifying and enforcingpolicies that rely on both reason and trust. In particular,BLF supports extensible software systems that employboth digitally signed code and language-based security, especiallyproof-carrying code. We describe BLF, establishsome of its fundamental properties, and explain its use.
Design and analysis of a scheme to mitigate condensation on an assembly used to cool a processor module
Authors: M. J. Ellsworth, R. Schmidt, D. Agonafer
Venue: IBM Journal of Research and Development (2002)

System performance of an IBM RS/6000Â® workstation was improved by cooling to sub-ambient temperatures the CMOS circuits of a single-chip module (SCM) mounted on a card. However, when refrigeration temperatures are sufficiently low, the temperature of all or a portion of the card on which the module is mounted can fall below the environmental dew point, resulting in unwanted condensation. Strategically placed heaters can maintain the temperature of the card surface above the dew point, but at the expense of increasing the total heat load the refrigeration unit must remove from the system. A 3D finite element analysis was used to investigate some of the key parameters that affect the thermal packaging design of a refrigeration-cooled low-temperature processor module with the objective of preventing condensation on exposed module card surfaces with minimal power input to the added heaters.
Reengineering Web Applications Based on Cloned Pattern Analysis
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Web Applications are subject to continuous and rapidevolution. Often it happens that programmersindiscriminately duplicate Web pages withoutconsidering systematic development and maintenancemethods. This practice creates code clones that makeWeb Applications hard to maintain and reuse. This paperpresents an approach for reengineering WebApplications based on clone analysis that aims atidentifying and generalizing static and dynamic pagesand navigational patterns of a web application. Cloneanalysis is also helpful for identifying literals that can begenerated from a database. A case study is describedwhich shows how the proposed approach can be used forrestructuring the navigational structure of a WebApplication by removing redundant code.
Non-clair voy ant multiprocessor scheduling of jobs with changing execution characteristics
Authors: Jeff Edmonds, Donald D. Chinn, Tim Brecht, Xiaotie Deng
Venue: Journal of Scheduling (2003)

This work theoretically proves that Equi-partition efficiently schedules multiprocessor batch jobs with different execution characteristics. Motwani, Phillips, and Torng (Proc. 4th Annu. ACMISIAM Symp. on Discrete Algorithms, pp. 422-431, Austin, 1993) show that the mean response time of jobs is within two of optimal for fully parallelizable jobs. We extend this result by considering jobs with multiple phases of arbitrary nondecreasing and sublinear speedup functions. Having no knowledge of the jobs being scheduled (non-clairvoyant) one would not expect it to perform well. However, our main result shows that the mean response time obtained with Equi-partition is no more than 2 + √ ≈ 3.73 times the optimal. The paper also considers schedulers with different numbers of preemptions and jobs with more general classes of speedup functions. Matching lower bounds are also proved.
Beyond anarchy: self-organized topology for peer to peer networks
Authors: Fabrice Saffre, Robert Ghanea-Hercock
Venue: Complexity (2003)

In this article, we discuss the new constraints that will apply to future, highly dynamic networks and investigate one of the major problems that is likely to affect their deployment: traffic/workload distribution. Starting with a very simple model, we demonstrate that a structure made of undifferentiated subunits will almost inevitably hit a scalability barrier, unless new design rules are applied. We then give quantitative evidence that a hybrid network topology termed the "hypergrid" could have the potential of solving some of the most critical problems (relay overload and network vulnerability), yet could still be produced by applying local rules only.
Note: maximal triangulations of a regular prism
Authors: Mike Develin
Venue: Journal of Combinatorial Theory Series A (2004)

In this paper, we answer two conjectures of De Loera, Santos, and Takeuchi by demonstrating that the maximal size of a triangulation of a prism over a regular n-gon is [n2 + 6n - 16/4], and that the maximal size of a regular triangulation of the regular n-antiprism is [n2 + 8n - 16/4].
Corpus structure, language models, and ad hoc information retrieval
Authors: Oren Kurland, Lillian Lee
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Most previous work on the recently developed language-modeling approach to information retrieval focuses on document-specific characteristics, and therefore does not take into account the structure of the surrounding corpus. We propose a novel algorithmic framework in which information provided by document-based language models is enhanced by the incorporation of information drawn from clusters of similar documents. Using this framework, we develop a suite of new algorithms. Even the simplest typically outperforms the standard language-modeling approach in precision and recall, and our new interpolation algorithm posts statistically significant improvements for both metrics over all three corpora tested.
Intrinsic bursting activity in the pre-B&#x00f6;tzinger Complex: Role of persistent sodium and potassium currents
Authors: Ilya A. Rybak, Natalia A. Shevtsova, Krzysztof Ptak, Donald R. McCrimmon
Venue: Biological Cybernetics (2004)

Computational models of single pacemaker neuron and neural population in the pre-B&#x00f6;tzinger Complex (pBC) were developed based on the previous models by Butera et al. (1999a,b). Our modeling study focused on the conditions that could define endogenous bursting vs. tonic activity in single pacemaker neurons and population bursting vs. asynchronous firing in populations of pacemaker neurons. We show that both bursting activity in single pacemaker neurons and population bursting activity may be released or suppressed depending on the expression of persistent sodium (INaP) and delayed-rectifier potassium (IK) currents. Specifically, a transition from asynchronous firing to population bursting could be induced by a reduction of IK via a direct suppression of the potassium conductance or through an elevation of extracellular potassium concentration. Similar population bursting activity could be triggered by an augmentation of INaP. These findings are discussed in the context of the possible role of population bursting activity in the pBC in the respiratory rhythm generation in vivo vs. in vitro and during normal breathing in vivo vs. gasping.
Biclustering in Gene Expression Data by Tendency
Authors: Jinze Liu, Jiong Yang, Wei Wang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The advent of DNA microarray technologies has revolutionized the experimental study of gene expression. Clustering is the most popular approach of analyzing gene expression data and has indeed proven to be successful in many applications. Our work focuses on discovering a subset of genes which exhibit similar expression patterns along a subset of conditions in the gene expression matrix. Specifically, we are looking for the Order Preserving clusters (OPCluster), in each of which a subset of genes induce a similar linear ordering along a subset of conditions. The pioneering work of the OPSM model[3], which enforces the strict order shared by the genes in a cluster, is included in our model as a special case. Our model is more robust than OPSM because similarly expressed conditions are allowed to form order equivalent groups and no restriction is placed on the order within a group. Guided by our model, we design and implement a deterministic algorithm, namely OPCTree, to discover OP-Clusters. Experimental study on two real datasets demonstrates the effectiveness of the algorithm in the application of tissue classification and cell cycle identification. In addition, a large percentage of OP-Clusters exhibit significant enrichment of one or more function categories, which implies that OP-Clusters indeed carry significant biological relevance.
Trajectory-based codes
Authors: Michael Domaratzki
Venue: Acta Informatica (2004)

The notion of shuffle on trajectories is a natural generalization of many word operations considered in the literature. For a set of trajectories T, we define the notion of a T-code and examine its properties. Particular instances of T-codes are prefix-, suffix-, infix-, outfix- and hyper-codes, as well as other classes studied in the literature.
Locality preserving indexing for document representation
Authors: Xiaofei He, Deng Cai, Haifeng Liu, Wei-Ying Ma
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Document representation and indexing is a key problem for document analysis and processing, such as clustering, classification and retrieval. Conventionally, Latent Semantic Indexing (LSI) is considered effective in deriving such an indexing. LSI essentially detects the most representative features for document representation rather than the most discriminative features. Therefore, LSI might not be optimal in discriminating documents with different semantics. In this paper, a novel algorithm called Locality Preserving Indexing (LPI) is proposed for document indexing. Each document is represented by a vector with low dimensionality. In contrast to LSI which discovers the global structure of the document space, LPI discovers the local structure and obtains a compact document representation subspace that best detects the essential semantic structure. We compare the proposed LPI approach with LSI on two standard databases. Experimental results show that LPI provides better representation in the sense of semantic structure.
Spectra Generation for Fixed-Polarity Reed-Muller Transform over GF(5)
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This paper examines several basic methods that can beused to obtain the Fixed-Polarity Reed-Muller (FPRM)spectra for functions defined over Galois Field (5)(GF(5)). The fundamental concepts of the methods arediscussed and their computational costs in terms ofaddition and multiplication numbers are presented. Theexperimental results for 5-valued functions using themethods described in this paper are also listed andcompared with each other.
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction
Authors: Michael Monagan
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

Let n/d ∈ Q, m be a positive integer and let u = n/d mod m. Thus $u$ is the image of a rational number modulo m. The rational reconstruction problem is; given u and m find n/d. A solution was first given by Wang in 1981. Wang's algorithm outputs n/d when m > 2 M2 where M = max(|n|,d). Because of the wide application of this algorithm in computer algebra, several authors have investigated its practical efficiency and asymptotic time complexity.In this paper we present a new solution which is almost optimal in the following sense; with controllable high probability, our algorithm will output n/d when m is a modest number of bits longer than 2 |n| d. This means that in a modular algorithm where m is a product of primes, the modular algorithm will need one or two primes more than the minimum necessary to reconstruct n/d; thus if |n| ⇐ d or d ⇐ |n| the new algorithm saves up to half the number of primes. Further, our algorithm will fail with high probability when m < 2 |n| d.
Photoelectron spectroscopy of ultrathin Yttrium Oxide films on Si(100)
Authors: A. Ohta, M. Yamaoka, S. Miyazaki
Venue: Microelectronic Engineering (2004)

The Y2O3/SiO2/Si(100) stack structures were prepared by the thermal decomposition of a yttrium organic complex in O2 ambient at 350°C and subsequent O2-anneal at 500 °C. From the analysis of O1s energy loss spectra, the energy band gap was determined to be 6.0 ± 0.05 eV for Y2O3 and 8.9 ± 0.05 eV for interfacial SiO2. By deconvoluting the valence band spectra into the components, valence band offsets for Y2O3 with respect to Si(100) and interfacial SiO2 were obtained to be ∼3.3 and ∼1.3 eV. respectively, which indicates the conduction band offset of ∼1.58 eV between Y2O3 and Si(100). Total photoelectron yield spectra show an increase in the electronic defect states with post depositien O2-anneal in the temperature range 300-700 °C. which is related to the formation of interfacial SiO2 layer at such low temperatures.
Self-Optimising Data Farming for Web Applications
Authors: D. Burnell, A. Al-Zobaidie, G. Windall, A. Butler
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Many Web applications walk the thin line between the need for dynamic data and the need to meet user performance expectations. In environments where funds are not available to constantly upgrade hardware in-line with user demand, alternative approaches need to be considered. This paper introduces a 'Data farming' model whereby dynamic data, which is 'grown' in operational applications, is 'harvested' and 'packaged' for various consumer markets. Like any well managed agricultural operation, crops are harvested according to historical and perceived demand as inferred by a self-optimising process. This approach aims to make enhanced use of available resources through better utilisation of system downtime - thereby improving application performance and increasing the availability of key business data.
An Effective Solution of Benchmarking Problem FSM Benchmark Generator and Its Application to Analysis of State Assignment Methods
Authors: Lech Jozwiak, Dominik Gawlowski, Aleksander Slusarczyk
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper focuses on the benchmarking that is one of the main issues of the synthesis method and tool development, analysis, characterization and evaluation. To solve several serious problems related to the usage of practical industrial benchmarks, we developed and implemented an FSM Benchmark Generator (BenGen). BenGen makes us possible to efficiently construct FSMs with various known characteristics, including FSMs representative to various typical industrial application areas, greatly reduces the necessity of having the actual industrial benchmarks, and enables research, comparison, evaluation and fine tuning of circuit synthesis methods largely independent of the industry, and much more effectively and efficiently than having only some industrial benchmarks. Using a large set of benchmarks generated with BenGen, we performed an experiment aiming at the effectiveness characterization of some popular academic and industrial FSM state assignment approaches. The experimental results enabled us among others to demonstrate that the pragmatic assignment approaches used commonly in today's commercial tools are only effective for some special classes of circuits or not effective at all.
Realizing Business Components, Business Operations and Business Services
Authors: David Flaxer, Anil Nigam
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Business components are founded on the notion that complex business organizations can be decomposed into discrete into self-functioning logical units. Decomposing an enterprise into business components facilitates a logical understanding of business design and can be leveraged to provide finer levels of detailed analysis on how it operates. This involves a range of improvements, from evaluating and validating business organization structures, extending to ways of expressing dynamic relationships among business components, and finally, influencing the IT application base and infrastructure that realize the business intent.
Quality of Service Process Variables in Complex B2B Systems Integration Assessment
Authors: R. William Maule, Shelley P. Gallup, Gordon Schacher
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

This paper presents QoS variables in the organization of complex business processes in large-scale systems integration. A specific focus is on QoS assessment structures that address variables to include: (a) network infrastructure evolution; (b) open and proprietary mid-level applications; and (c) decision-support processes assessing technologies and capabilities. The research is based on a QoS analysis system for complex military B2B and systems integration projects.
Model-free functional MRI analysis based on unsupervised clustering
Authors: Axel Wismüller, Anke Meyer-Bäse, Oliver Lange, Dorothee Auer, Maximilian F. Reiser, DeWitt Sumners
Venue: Journal of Biomedical Informatics (2004)

Conventional model-based or statistical analysis methods for functional MRI (fMRI) are easy to implement, and are effective in analyzing data with simple paradigms. However, they are not applicable in situations in which patterns of neural response are complicated and when fMRI response is unknown. In this paper the "neural gas" network is adapted and rigourosly studied for analyzing fMRI data. The algorithm supports spatial connectivity aiding in the identification of activation sites in functional brain imaging. A comparison of this new method with Kohonen's self-organizing map and with a fuzzy clustering scheme based on deterministic annealing is done in a systematic fMRI study showing comparative quantitative evaluations. The most important findings in this paper are: (1) both "neural gas" and the fuzzy clustering technique outperform Kohonen's map in terms of identifying signal components with high correlation to the fMRI stimulus. (2) the "neural gas" outperforms the two other methods with respect to the quantization error, and (3) Kohonen's map outperforms the two other methods in terms of computational expense. The applicability of the new algorithm is demonstrated on experimental data.
Performance Study of Load Balancing Strategies for Simulators of Nanoscale Measurements of Material Properties
Authors: Yingwen Song, Satoshi Watanabe
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

We have compared various load balancing strategies for the program which was developed by our group to simulate nanoscale measurements of material properties. Among the strategies we have examined, static block distributions, static cyclic distributions, self-adapting block distributions, dynamic load balancing, and hybrid load balancing, the hybrid approach has been proven to give the best performance for the program on Hitachi SR8000.
Design and CAD Challenges in sub-90nm CMOS Technologies
Authors: Kerry Bernstein, Ching-Te Chuang, Rajiv Joshi, Ruchir Puri
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

This paper discusses design challenges of scaled CMOS circuits insub-90nm technologies for high-performance digital applications.To continue scaling of the CMOS devices deep into sub-90nm tech-nologies,fully depleted SOI, strained-Si on SiGe, FinFETs withdouble gate, and even further, three-dimensional circuits will be uti-lizedto design high-performance circuits. We will discuss uniquedesign aspects and issues resulting from this scaling such as gate-to-body tunneling, self-heating, reliability issues, and process vari-ations.As the scaling approaches various physical limits, new SOIdesign issues such as Vt modulation due to leakage, low-voltageimpact ionization, and higher V{t,lin} to maintain adequate V{t,sat},continue to surface.With an eye towards the future, design andCAD issues related to sub-65nm device structures such as doublegate FinFET will be discussed.
Completeness of a combination of neighbourhood logic and temporal logic
Authors: Rana Barua
Venue: Formal Aspects of Computing (2004)

This paper presents a completeness result, with respect to a possible world semantics, for a combination of a first-order temporal logic and neighbourhood logic. This logic was considered by Qiu and Zhou (1998, Proceedings of the PROCOMET &#x2018;98, pp 444&#x2013;461) to define semantics of a real-time OCCAM-like programming language.
Efficient Secure Multicast with Well-Populated Multicast Key Trees
Authors: M. Moharrum, R. Mukkamala, M. Eltoweissy
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Secure group communications is the basis for many recent multimedia and web technologies.In order to maintain secure and efficient communications within a dynamic group, it isessential that the generation and management of group key(s) be secure and efficient with real-time response. Typically, a logical key hierarchy is used for distribution of group keys to users so that whenever users leave or join the group, newkeys are generated and distributed using the key hierarchy. In this paper, we propose Well-Populated Multicast Key Tree (WPMKT), a new efficient technique to handle group dynamics in the key tree and maintain the tree balanced withminimal cost. In WPKT, sub-trees are swapped in a way that keeps the key tree balanced and well populated. At the same time, rekeying overhead due to reorganization is kept at aminimum. Another advantage of WPKT is that rebalancing has no effect on the internal keystructure of the swapped sub-trees Results from simulation studies show that under random user deletion, our approach achieves one order of magnitude in overhead less than existingapproaches. Under clustered sequential user deletion, our approach achieves almost a lineargrowth with tree size under individual rebalancing. For periodic rebalancing, weachieved almost half the overhead introduced by other approaches.