ppxscal/embedding_network huggingface dataset:
A Dynamic Capability Framework for Context-Aware Mobile Services
Authors: Chin-Chih Chang, Judy C. R. Tseng, Kwei-Jay Lin
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

The development of mobile services becomes more challenging when context-awareness is taken into account. There are many problems in designing a successful context-aware mobile SOA. In this paper, we introduce the model of "dynamic capabilities" to study how systems can dynamically integrate, compose, and reconfigure internal and external competencies in responding to rapidly-changing environments. In our study the applications are classified into four levels of requirement, from the non-dynamic (i.e. static) level in which the contexts of clients, intermediate media, and services are all static, to the highly dynamic level in which all aspects are dynamic. Based on this model mobile SOA issues may be systematically identified and solutions incrementally designed. A framework that facilitates mobile SOA is also presented.
Computational proteomics analysis of binding mechanisms and molecular signatures of the HIV-1 protease drugs
Authors: Gennady Verkhivker
Venue: Artificial Intelligence in Medicine (2009)

Objective: Computational proteomics analysis of biomolecular interactions is proposed to determine molecular signatures of the HIV-1 protease inhibitors. A comparative microscopic analysis is conducted for a panel of inhibitors which exemplify a diversity of the HIV-1 PR binding mechanisms, from the active site inhibition to intervening with the protease folding and dimerization. Methods and materials: Replica-exchange Monte Carlo simulations with the conformational ensembles of the HIV-1 PR dimer and monomer structures enable a molecular analysis underlying diversity of the HIV-1 PR binding mechanisms. Results: We have investigated the molecular basis underlying diversity of the HIV-1 PR binding mechanisms. The molecular basis of the HIV-1 PR active site and dimerization inhibition mechanisms has been analyzed for an active site tripeptide inhibitor and a tetrapeptide inhibitor, which can act as both a dimerization inhibitor and a competitive active site inhibitor. We have also simulated a structural mimicry mechanism of the HIV-1 PR folding inhibition and dimerization, according to which the folding inhibitor targets the conserved HIV-1 PR regions by mimicking the interaction network of the active dimer. Conclusions: We have shown that binding interfaces of the studied dimerization and folding HIV-1 PR inhibitors may enable structural mimicry with the hot spot residues of the HIV-1 PR dimer. The proposed structural models of intervening with the HIV-1 PR dimerization and folding support the mechanism of structural mimicry, which may alleviate drug resistance effects.
An Integration of CoTraining and Affinity Propagation for PU Text Classification
Authors: Na Luo, Fuyu Yuan, Wanli Zuo
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Under the framework of PU(Positive data and Unlabeled data), this paper originally proposes a three-setp algorithm. First, CoTraining is employed for filtering out the likely positive data from the unlabeled dataset U. Second, affinity propagation (AP) approach attempts to pick out the strong positive from likely positive set which is produced in first step. Those data picked out can be supplied to positive dataset P. Finally, a linear One-Class SVM will learn from both the purified U as negative and the expanded P as positive. Because of the algorithm's characteristic of automatic expanding positive dataset, the proposed algorithm especially performs well in situations where given positive dataset P is insufficient. A comprehensive experiment had proved that our algorithm is preferable to the existing ones.
A methodology for application-specific NoC architecture generation in a dynamic task structure environment
Authors: Balasubramanian Sethuraman, Ranga Vemuri
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

To avoid bandwidth violations, the NoC architecture generation phase must consider the bandwidth variation along various links. In this paper, we analyze the impact of the dynamic nature of task graphs on bandwidth requirements and present an algorithm to find the Minimum BandWidth Guarantee along the various links of the NoC architecture.
On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem
Authors: Beate Bollig
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Ordered binary decision diagrams (OBDDs) are one of the most common dynamic data structures for Boolean functions. Among the many areas of application are verification, model checking, computer aided design, relational algebra, and symbolic graph algorithms. Threshold functions are the basic functions for discrete neural networks and are used as building blocks in the design of symbolic graph algorithms. In this paper the first exponential lower bound on the size of a more general model than OBDDs and the first nontrivial asymptotically optimal bound on the OBDD size for a threshold function are presented. Furthermore, if the number of different weights is a constant it is shown that computing an optimal variable order for multiple output threshold functions is NP-hard whereas for single output function the problem is solvable in deterministic polynomial time.
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
Authors: Olli Bräysy, Pasi P. Porkka, Wout Dullaert, Panagiotis P. Repoussis, Christos D. Tarantilis
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents an efficient and well-scalable metaheuristic for fleet size and mix vehicle routing with time windows. The suggested solution method combines the strengths of well-known threshold accepting and guided local search metaheuristics to guide a set of four local search heuristics. The computational tests were done using the benchmarks of [Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721-732] and 600 new benchmark problems suggested in this paper. The results indicate that the suggested method is competitive and scales almost linearly up to instances with 1000 customers.
Experiments with in-transit processing for data intensive grid workflows
Authors: Virai Bhat, Manish Parashar, Scott Klasky
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Efficient and robust data streaming and in-transit data manipulations are critical requirements of emerging scientific and engineering application workflows, which are based on seamless interactions and coupling between geographically distributed application components. The overall goal of this research is to address these requirements and develop a data streaming and in-transit data manipulation service. In this paper, we experimentally investigate reactive management strategies for in-transit data manipulation, as well as cooperative end-to-end management for wide-area data-streaming and in-transit data manipulation for data-intensive scientific and engineering workflows.
Computerized transportation-distribution: a user overview
Authors: Jack W. Farrell, William R. McCartin, Frank J. Cyrkiewicz, Edmund R. Piesciuk, Phillip T. Catalano, Jack W. Farrell
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

BUSINESS LOGISTICS is an ever-growing customer for computer services in manufacturing or marketing-oriented firms. Transportation, inventory control, order processing and myriad related activities require intensive computer support to meeting competitive pressures, reduce operating costs and improve customer services.
Detecting real singularities of a space curve from a real rational parametrization
Authors: R. Rubio, J. M. Serradilla, M. P. Vélez
Venue: Journal of Symbolic Computation (2009)

In this paper we give an algorithm that detects real singularities, including singularities at infinity, and counts local branches and multiplicities of real rational curves in the affine n-space without knowing an implicitization. The main idea behind this is a generalization of the D-resultant (see [van den Essen, A., Yu, J.-T., 1997. The D-resultant, singularities and the degree of unfaithfulness. Proc. Amer. Math. Soc. 25 (3), 689-695]) to n rational functions. This allows us to find all real parameters corresponding to the real singularities between the solutions of a system of polynomials in one variable.
Effect of annealing on Zn1-xCoxO thin films prepared by electrodeposition
Authors: A. El Manouni, M. Tortosa, F. J. Manjón, M. Mollar, B. Marí, J. F. Sánchez-Royo
Venue: Microelectronics Journal (2009)

Polycrystalline thin films of Zn"1"-"xCo"xO with different cobalt (Co) content were grown on indium tin oxide (ITO) substrates by cathodic electrodeposition technique and subsequently annealed in air at 400^oC. The effect of annealing in their structural, optical and chemical properties has been characterized by X-ray diffraction (XRD), energy-dispersive spectroscopy (EDS), X-ray photoelectron spectroscopy (XPS), Raman scattering and optical spectroscopy. Our measurements indicate that moderate annealing increases the crystal quality of the films. The films are highly transparent in the visible range and evidence an increase of the band gap and of the intensity of three typical Co absorption bands in the visible with the amount of Co. Thermal annealing produces an increase of the intensity of the Co^2^+-related absorption bands revealing that higher amount of Co atoms are occupying Zn sites.
Allocating outpatient clinic services using simulation and linear programming
Authors: Martin J. Miller, David M. Ferrin, Niloo Shahi, Rich LaVecchia
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A large number of operational tools exist to help researchers determine business solutions for their customers. Each individual tool serves a distinct purpose for specific types of problems. Deciding which tool to use requires knowledge and experience. Sometimes, the researcher should integrate several tools because each tool may get too complex or not form a complete solution. This paper discusses how simulation, linear programming and spreadsheet analysis were integrated to help a new hospital determine ideal space assignments, schedule configurations and throughput targets for numerous clinic services.
Design an Aperiodic Stochastic Resonance Signal Processor for Digital Watermarking
Authors: Shuifa Sun, Bangjun Lei, Sheng Zheng, Sam Kwong, Xuejun Zhou
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

In this paper, we propose an aperiodic stochastic resonance (ASR) signal processor for communication systems based on a bi-stable mechanism. This processor can detect base-band binary pulse amplitude modulation (PAM) signals. In this processor related parameters can be adjusted. The adjustment mechanism is explained from the perspective of the conventional noise-induced nonlinear signal processing. To demonstrate this processors usability, based on it we implemented a digital image watermarking algorithm in the discrete cosine transform (DCT) domain. In this algorithm, the watermark and the DCT alternating current (ac) coefficients of the image are viewed as the input signal and the channel noise, respectively. This phenomenon that the detection bit error ratio (BER) of the system suffering from certain attacks is lower than that of the system not suffering from any attack is systematically analyzed.
What were you thinking?: filling in missing dataflow through inference in learning from demonstration
Authors: Melinda T. Gervasio, Janet L. Murdock
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Recent years have seen a resurgence of interest in programming by demonstration. As end users have become increasingly sophisticated, computer and artificial intelligence technology has also matured, making it feasible for end users to teach long, complex procedures. This paper addresses the problem of learning from demonstrations involving unobservable (e.g., mental) actions. We explore the use of knowledge base inference to complete missing dataflow and investigate the approach in the context of the CALO cognitive personal desktop assistant. We experiment with the Pathfinder utility, which efficiently finds all the relationships between any two objects in the CALO knowledge base. Pathfinder often returns too many paths to present to the user and its default shortest path heuristic sometimes fails to identify the correct path. We develop a set of filtering techniques for narrowing down the results returned by Pathfinder and present experimental results showing that these techniques effectively reduce the alternative paths to a small, meaningful set suitable for presentation to a user.
A localization architecture for indoor parking areas
Authors: M. Di Mauro, R. Garufi, A. L. Robustelli, M. Longo, P. Addesso
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

Wireless Local Access Network (WLAN) technology provides mobility services to network users. In this paper a significant value was added to this technology, by proposing an inexpensive framework providing advanced location determination services. Our target environment is an indoor parking area. For this area a comprehensive architecture and infrastructure are experimented, which are composed of several WLAN Access Points able to capture radio signals emitted from user equipments, and a Location Server able to estimate the user position using an appropriate fingerprinting-based location algorithm. In such a way a typical WLAN infrastructure will not only provide data communication services to mobile users (e.g. for network service access), but will also provide accurate localization information which can be exploited by a wide variety of advanced location-based and value-added applications.
Machine-code verification for multiple architectures: an application of decompilation into logic
Authors: Magnus O. Myreen, Michael J. C. Gordon, Konrad Slind
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

Realistic formal specifications of machine languages for commercial processors consist of thousands of lines of definitions. Current methods support trustworthy proofs of the correctness of programs for one such specification. However, these methods provide little or no support for reusing proofs of the same algorithm implemented in different machine languages. We describe an approach, based on proof-producing decompilation, which both makes machine-code verification tractable and supports proof reuse between different languages. We briefly present examples based on detailed models of machine code for ARM, PowerPC and x86. The theories and tools have been implemented in the HOL4 system.
Key Microarchitectural Innovations for Future Microprocessors
Authors: Antonio González
Venue: Proceedings of the 22nd International Conference on Architecture of Computing Systems (2009)

Microprocessors have experienced tremendous performance improvements generation after generation since its inception. Moore's law has fueled this evolution and will keep doing it in forthcoming generations. However, future microprocessors are facing new challenges that require innovative approaches to keep delivering improvements comparable to those that we have enjoyed so far. Power dissipation is a main challenge in all segments, from ultra-mobile to high-end servers. Another important challenge is the fact that we have relied on instruction-level parallelism (ILP) as a main lever to improve performance, but after more than 30 years of enhancing ILP techniques we are approaching a point of diminishing returns. In this talk we will discuss these challenges and propose some solutions to tackle them. Multicore is a recently adopted approach in most microprocessors that offers significant advantages in terms of power and exploits a new source of parallelism: thread-level parallelism. In this talk we will discuss the benefits of multicore and also show its limitations. We will also describe some other technologies that we believe are needed to complement the benefits of multicore and offer all together a foundation for future microprocessors.
Annotation and Image Markup: Accessing and Interoperating with the Semantic Content in Medical Imaging
Authors: Daniel L. Rubin, Pattanasak Mongkolwat, Vladimir Kleper, Kaustubh Supekar, David S. Channin
Venue: IEEE Intelligent Systems (2009)

Medical images are proliferating at an explosive pace, similar to other types of data in e-Science. While Semantic Web techniques are being created to access much raw biomedical data, the rich information in images is not currently accessible. We are creating methods and tools to enable people to access large distributed collections of medical images in cyberspace as well as within hospital information systems. In this report, we describe our approach, "Annotation and Image Markup" (AIM), in which human and machine descriptions of image content is made explicit and accessible using ontologies. AIM includes the following components: an ontology of image annotation and markup, specifying entities and relations to represent the semantics of images; an image annotation tool to collect annotations from people viewing images as instances of the ontology; and a serialization module to store the image annotation information in a variety of standard formats, enabling interoperability among a variety of systems that contain images: medical records systems, image archives in hospitals, and the Semantic Web. Through these methods, we hope to enable the scientific community who work with images to access their semantic contents and integrate them with related non-imaging information so they exploit the image information effectively.
PMD: A Low-Power Code for Networks-on-Chip Based on Virtual Channels
Authors: Alberto García-Ortiz, Leandro S. Indrusiak, Tudor Murgan, Manfred Glesner
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Virtual channels are a common alternative for providing quality-of-service to Networks-on-Chip. A drawback of the approach is the increased power consumption because of the suppression of correlation between consecutive flits. This work proposes an architecture based on low-power coding to overcome the aforementioned problem. The technique requires a minimum overhead, while obtaining a significant power reduction (45% in the average case). Exhaustive experimental simulations are provided to demonstrate the advantages of the proposed architecture.
Discovering Groups of Sibling Terms from Web Documents with XTREEM-SG
Authors: Marko Brunzel, Myra Spiliopoulou
Venue: Journal on Data Semantics XI (2008)

The acquisition of explicit semantics is still a research challenge. Approaches for the extraction of semantics focus mostly on learning subordination relations. The extraction of coordination relations, also called "sibling relations" is studied much less, though they are not less important in ontology engineering.We describe and evaluate the XTREEM-SG approach on finding sibling semantics from semi-structured Web documents. XTREEM-SG stands for "Xhtml TREE Mining - for Sibling Groups". It uses the XHTML-markup that is available in Web content to group together terms that are in a sibling relation to each other. Our approach has the advantage that it is domain and language independent; it does not rely on background knowledge, NLP software nor training.We evaluate XTREEM-SG towards two gold standard ontologies. We investigate how variations on input, parameters and gold standard influence the obtained results on structuring a closed vocabulary into semantic sibling groups. Earlier methods that evaluate sibling relations against a gold standard report a 14.18% F-measure on average sibling overlap. Our method improves this number into 22.93%.
Optimally Ensured Interactive Service in Distributed Multimedia Presentation Systems
Authors: Markus Mielke, Aidong Zhang
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we develop a new service to support optimally ensured user interactions with minimum latency in interactive distributed multimedia presentation environments. The novelty of our scheme is to reduce bandwidth requirements of a network in exchange of memory at the client side, because we expect an increase in network load in the next years in comparison to falling memory prices. Utilizing the properties of smoothing algorithms presented in the literature, we introduce the concepts of the interactive river bed and optimal interactive river bed, which guarantee optimal interactive service over the whole playback time of the video stream. Our approach provides optimal service for a given buffer size. We also derive requirements for a minimal buffer size in which we can give the optimal boundaries for an interactive transmission plan. Experiments demonstrate the effectiveness of the approach.
Machine Checking Proof Theory: An Application of Logic to Logic
Authors: Rajeev Goré
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Modern proof-assistants are now mature enough to formalise many aspects of mathematics. I outline some work we have done using the proof-assistant Isabelle to machine-check aspects of proof theory in general, and specifically the proof theory of provability logic GL.
License-exempt: Wi-Fi complement to 3G
Authors: W. Lemstra, V. Hayes
Venue: Telematics and Informatics (2009)

In this paper we compare and contrast the development of Wi-Fi as a license-exempt wireless broadband technology to access the internet with the licensed regime of broadband cellular networks such as 3G. This exploration is based on an assessment of the two different innovation journeys which resulted from two different underlying communication paradigms and two different regulatory regimes, leading to different business models and different diffusions patterns. In concluding we compare the merits of the two cases and derive recommendations for policy and strategy formation.
Adaptive Jacobian position/force tracking control of free-flying manipulators
Authors: Hanlei Wang, Yongchun Xie
Venue: Robotics and Autonomous Systems (2009)

This paper solves the problem of position/force tracking control of a free-flying space manipulator with uncertain kinematics and dynamics. A free-flying manipulator interacting with an uncertain compliant surface is considered. To cope with the uncertainties arising from free-flyer's kinematics, dynamics and surface stiffness and position, an adaptive Jacobian controller is devised. The convergence of the force and position tracking errors is proved based on Lyapunov stability analysis. Numerical simulation is presented to show the performance of the controller.
Correlation between nitrogen and carbon incorporation into MOVPE ZnO at various oxidizing conditions
Authors: J. J. Zhu, L. Vines, T. Aaltonen, A. Yu. Kuznetsov
Venue: Microelectronics Journal (2009)

Nitrogen-doped ZnO films with preferential (0001) orientation were synthesized on c-Al"2O"3 and Si substrates by metal organic vapor phase epitaxy (MOVPE) using tertiary butanol (t-BuOH) and/or N"2O as oxidizers for diethylzinc (DEZ). A striking correlation between nitrogen and carbon incorporation into ZnO was revealed by concentration versus depth profiling employing secondary ion mass spectrometry (SIMS), consistently with recently reported simulations of nitrogen-carbon complexing.