ppxscal/embedding_network huggingface dataset:
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Authors: Gustavo Alonso
Venue: Middleware Conference (2005)

Today, middleware is a key part of almost any application. Gone are the days when middleware was only used in the IT industry for high-end applications. Rather than middleware being part of the IT world, today IT applications represent only one aspect of middleware. With the increase in distribution, network capacity, and widespread deployment of computing devices (in homes, automobiles, mobile phones, etc.), middleware has surpassed the importance of operating systems as the platform where application development and deployment take place. This makes middleware very exciting as a research area but also a very challenging one since it encompasses many different concepts and techniques from a wide variety of fields: networking, distributed systems, software engineering, performance analysis, computer architecture, and data management. Middleware 2005 in Grenoble, France, was the 6th edition of an increasingly successful conference. The scope of the conference has been slowly widening with every edition to accommodate new fields and applications. This year we made a considerable effort to reach out to other communities who are also active in the general area of middleware --- sensor networks, networks in general, databases, software engineering --- a fact that is reflected in the variety of submissions. The program this year was selected from over 112 submissions. From these, the Program Committee selected 18 full papers and 6 short papers. Each paper had at least four reviews and the selection was made based on technical merit, relevance, originality of the contribution, and degree of innovation. Preference was given to papers with new ideas or covering novel application areas. Among the accepted papers, there was a fair number of PC papers. For the record, PC papers had to be clearly above other papers to be considered for acceptance. In this Call for Papers, we did not include work-in-progress papers. Instead, we introduced short papers --- selected from the regular submissions as papers that had interesting ideas but were not ready for publication as full papers --- and a demo session with a separate Call for Papers --- which should give a venue to present systems-oriented research. As in the past, the review process was highly selective and the source of many interesting discussions on the nature of middleware and its general applicability. The exciting program that was prepared reflects these discussions and created the perfect background for similar discussions during the conference. Together with the workshops that accompanied the conference, Middleware 2005 covered a wide range of issues and topics related to all aspects of middleware, from software engineering to low-level implementation details.
A Feasibility Pump for mixed integer nonlinear programs
Authors: Pierre Bonami, G&#x00e9;rard Cornu&#x00e9;jols, Andrea Lodi, Fran&#x00e7;ois Margot
Venue: Mathematical Programming: Series A and B (2009)

We present an algorithm for finding a feasible solution to a convex mixed integer nonlinear program. This algorithm, called Feasibility Pump, alternates between solving nonlinear programs and mixed integer linear programs. We also discuss how the algorithm can be iterated so as to improve the first solution it finds, as well as its integration within an outer approximation scheme. We report computational results.
Research on Money, Inflation and Economic Growth in China Based on DAG
Authors: Naipeng Hu, Qiwen Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

It’s a key problem for each country to balance and choose among money supply, inflation and economic growth. A DAG model can place restrictions on over recognitions of the innotion terms in a structural VAR model constituted by macroeconomic variables and can show the corresponding period and dynamic causality of economic variables at the same time. Using DAG model this paper finds that monetary supply is the corresponding period cause, short-term cause and long-term cause of GDP growth. This proves the monetary polices in China are unneutural. The short-term money has exogenesis; the long-term monetary supply has notable influence on Chinese economic growth, and the monetary market is influenced by the enforcement result of monetary policies. It is also discovered that the expansion of monetary supply may cause inflation, which means the monetary policies have the ability to influence the price; while the inflation has an uncertain short-term influence on economic growth and has certain long-term influence on economic growth.
Security and privacy for geospatial data: concepts and research directions
Authors: Elisa Bertino, Bhavani Thuraisingham, Michael Gertz, Maria Luisa Damiani
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

Geospatial data play a key role in a wide spectrum of critical data management applications, such as disaster and emergency management, environmental monitoring, land and city planning, and military operations, often requiring the coordination among diverse organizations, their data repositories, and users with different responsibilities. Although a variety of models and techniques are available to manage, access and share geospatial data, very little attention has been paid to addressing security concerns, such as access control, security and privacy policies, and the development of secure and in particular interoperable GIS applications. The objective of this paper is to discuss the technical challenges raised by the unique requirements of secure geospatial data management and to suggest a comprehensive framework for security and privacy for geospatial data and GIS. Such a framework is the first coherent architectural approach to the problem of security and privacy for geospatial data.
Distributed service framework: an innovative open ecosystem for ICT/Telecommunications
Authors: Rosario Alfano, Antonio Manzalini, Corrado Moiso
Venue: Proceedings of the 2007 Workshop on INnovative SERvice Technologies (2007)

In order to fuel new emerging service markets, next generation service delivery framework have to be based on an highly distributed and open architectures adopting innovative technologies capable of enabling features such as robustness, security, stability and scalability. The talk will elaborate on RT&D activities and results concerning a Distributed Service Framework (DSF) solution that has been designed as an innovative open eco-system for ICT/Telecommunications services. Specifically, the DSF architecture is based on multiple autonomic components that are interacting each other via a self-organising overlay. Particular attention is devoted to the service execution environment of the DSF where scalability and dynamic load balancing are met by self-organization capabilities of the components. The design choices, specifically the autonomic and altruistic local behavior of components and "ServiceSpace", enable global features effortlessly, simplifying implementation and management complexities.
Automatic Adjustment of Phase Locked Loop Transfer Function
Authors: Masahiro Yoshioka, Nobuo Fujii
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents an automatic adjustment of the transfer function of phase locked loop (PLL). The time constants and the gain factor of the transfer function are adjusted without opening the loop of PLL. The time constant adjustment is performed using a replica of the 1st order RC low pass filter and the gain factor is adjusted by detecting the open loop gain at the unity gain frequency. These adjustments are automatically carried out using a digitally controlled capacitance array and a digitally controlled charge pump. The proposed calibration can reduce the bandwidth error of ±30% to ±5% and the gain error of 7 dB to 1 dB.
A General Setting for the Pointwise Investigation of Determinacy
Authors: Yurii Khomskii
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

It is well-known that if we assume a large class of sets of reals to be determined then we may conclude that all sets in this class have certain regularity properties: we say that determinacy implies regularity properties classwise. In [Lö05] the pointwise relation between determinacy and certain regularity properties (namely the Marczewski-Burstin algebra of arboreal forcing notions and a corresponding weak version) was examined.An open question was how this result extends to topological forcing notions whose natural measurability algebra is the class of sets having the Baire property. We study the relationship between the two cases, and using a definition which adequately generalizes both the Marczewski-Burstin algebra of measurability and the Baire property, prove results similar to [Lö05].We also show how this can be further generalized for the purpose of comparing algebras of measurability of various forcing notions. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Providing route directions: design of robot's utterance, gesture, and timing
Authors: Yusuke Okuno, Takayuki Kanda, Michita Imai, Hiroshi Ishiguro, Norihiro Hagita
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Providing route directions is a complicated interaction. Utterances are combined with gestures and pronounced with appropriate timing. This study proposes a model for a robot that generates route directions by integrating three important crucial elements: utterances, gestures, and timing. Two research questions must be answered in this modeling process. First, is it useful to let robot perform gesture even though the information conveyed by the gesture is given by utterance as well? Second, is it useful to implement the timing at which humans speaks? Many previous studies about the natural behavior of computers and robots have learned from human speakers, such as gestures and speech timing. However, our approach is different from such previous studies. We emphasized the listener's perspective. Gestures were designed based on the usefulness, although we were influenced by the basic structure of human gestures. Timing was not based on how humans speak, but modeled from how they listen. The experimental result demonstrated the effectiveness of our approach, not only for task efficiency but also for perceived naturalness.
Testing the double phonemic boundary in bilinguals
Authors: Adrian Garcia-Sierra, Randy L. Diehl, Craig Champlin
Venue: Speech Communication (2009)

It is widely known that language influences the way speech sounds are categorized. However, categorization of speech sounds by bilinguals is not well understood. There is evidence that bilinguals have different category boundaries than monolinguals, and there is evidence suggesting that bilinguals' phonemic boundaries can shift with language context. This phenomenon has been referred as the double phonemic boundary. In this investigation, the double phonemic boundary is tested in Spanish-English bilinguals (N=18) and English monolinguals (N=16). Participants were asked to categorize speech stimuli from a continuum ranging from /ga/ to /ka/ in two language contexts. The results showed phonemic boundary shifts in bilinguals and monolinguals which did not differ across language contexts. However, the magnitude of the phoneme boundary shift was significantly correlated with the level of confidence in using English and Spanish (reading, writing, speaking, and comprehension) for bilinguals, but not for monolinguals. The challenges of testing the double phonemic boundary are discussed, along with the limitations of the methodology used in this study.
Improving WSN Base Station Survivability with Rejuvenation Technology
Authors: He Xin, Gui Xiaolin, Wei Wei
Venue: International Journal of Distributed Sensor Networks (2009)

The conventional security technology for WSN is mainly focused on improvement to the system's anti-invasion ability; however, seldom concerns how the system should go on providing external services after the invasion and failure, leading to the system's low survivability. In addition, base station is a keyport for WSN. Therefore, software rejuvenation technology is introduced into the construction of a survival model for WSN base station, in order to improve the overall WSN survival performance. The model includes the monitor, the analysis unit, the rejuvenation operation unit, the evaluation unit, strategy Database, etc. Its operation principles are as follows: first, the monitor can gets context information of the system recourses through agents (software sensors), and makes prompt examination and data collecting. Then, the analysis unit will make policy on the collected data, and judge the existence cause and harm degree of abnormal resource consumption by means of knowledge provided by strategies database, in order to perform the rejuvenation operation in time. When the rejuvenation occurs, it is necessary to clear the internal status (e.g., trash recycling, refreshing operation system tables, reinitializing internal data construction etc., adopting different operations in the presence of different strategies), to cut off exterior malicious links, to release system resources, and to restore system performance. Besides, when the rejuvenation operation is performed, the reconfiguration operation can also be adopted in order that patches are put on according to the system loophole, to avoid wrong reappearance caused by system interior drawbacks or the continuous occurrence of the same exterior attacks. Finally, according to the restored system performance, an evaluation of the original strategy which influenced the operation this time should be made and recorded in the strategies database by the evaluation unit, making the frame model adjust itself to a varied environment. Thus, the uninterrupted services can be provided by the system in face of attack or failure by the model, which monitors system performance to predict the rejuvenation interval and performs rejuvenation operation. Otherwise, the model is described by using the Semi-Markov Process and it is discovered that the detection probability of the system compromised state is the key parameter of improving the model's survivability by analyzing the model's stable health state probability. Too convienient for simulation, the base station survival model is described with Stochastic reward network and the experimental results gained by simulation tool SPNP show that the system detection probability is in inverse proportion of the failure probability. According to thought of rejuvenation technology, the failure probability can be reduced significantly by improving system detection probability so as to enhance the survivability of the system, and further improve the overall survival performance of WSN.
Towards an SMT proof format
Authors: Aaron Stump, Duckki Oe
Venue: Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning (2008)

The Edinburgh Logical Framework (LF) extended to support side condition code (LFSC) is advocated as a foundation for a proof format for SMT. The flexibility of the framework is demonstrated by example encoded inference rules, notably propositional resolution. Preliminary empirical results obtained with a SAT solver producing proofs in LFSC format are presented.
A comparison of CPUs, GPUs, FPGAs, and massively parallel processor arrays for random number generation
Authors: David Barrie Thomas, Lee Howes, Wayne Luk
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

The future of high-performance computing is likely to rely on the ability to efficiently exploit huge amounts of parallelism. One way of taking advantage of this parallelism is to formulate problems as "embarrassingly parallel" Monte-Carlo simulations, which allow applications to achieve a linear speedup over multiple computational nodes, without requiring a super-linear increase in inter-node communication. However, such applications are reliant on a cheap supply of high quality random numbers, particularly for the three main maximum entropy distributions: uniform, used as a general source of randomness; Gaussian, for discrete-time simulations; and exponential, for discrete-event simulations. In this paper we look at four different types of platform: conventional multi-core CPUs (Intel Core2); GPUs (NVidia GTX 200); FPGAs (Xilinx Virtex-5); and Massively Parallel Processor Arrays (Ambric AM2000). For each platform we determine the most appropriate algorithm for generating each type of number, then calculate the peak generation rate and estimated power efficiency for each device.
Polar forms and quadratic spline quasi-interpolants on Powell--Sabin partitions
Authors: D. Sbibih, A. Serghini, A. Tijini
Venue: Applied Numerical Mathematics (2009)

In this paper we introduce the Powell-Sabin B-spline representation of quadratic polynomials or splines in terms of their polar forms. We use this B-representation for constructing several differential or discrete quasi-interpolants which have an optimal approximation order. This new approach is simple and provides an efficient tool for describing many schemes of approximation involving values and (or) derivatives of a given function.
Identifying centers of circulating and spiraling vector field patterns and its applications
Authors: Ka Yan Wong, Chi Lap Yip
Venue: Pattern Recognition (2009)

Identification of centers of circulating and spiraling vector fields, sources and sinks are important in many applications. Tropical cyclone tracking, rotating object identification, analysis of motion video and movement of fluids are but some examples. In this paper, we introduce a method for finding the centers of circulating and spiraling vector field patterns. It can handle vector fields with multiple centers and is robust against noise. We provide a theoretical analysis on the validity of our method, and application examples in the fields of multimedia processing and meteorological computing to demonstrate its practical use.
Document Clustering for Event Identification and Trend Analysis in Market News
Authors: Lipika Dey, Anuj Mahajan, SK. Mirajul Haque
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper we have proposed a stock market analysis system that analyzes financial news items to identify and characterize major events that impact the market. The events have been identified using Latent Dirichlet Allocation(LDA) based topic extraction mechanism. The topic-document data is then clustered using kernel k means algorithm. The clusters are analyzed jointly with the SENSEX raw data to extract major events and their effects. The system has been implemented on capital market news about the Indian share market of the past three years.
Incrementally Mining Recently Repeating Patterns over Data Streams
Authors: Jia-Ling Koh, Pei-Min Chou
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

Repeating patterns represent temporal relations among data items, which could be used for data summarization and data prediction. More and more data of various applications is generated as a data stream. Based on time sensitive concern, mining repeating patterns from the whole history data sequence of a data stream does not extract the current trend of patterns over the stream. Therefore, the traditional strategies for mining repeating patterns on static database are not applicable to data streams. For this reason, an algorithm, named appearing-bit-sequence-based incremental mining algorithm, for efficiently discovering recently repeating patterns over a data stream is proposed in this paper. The appearing bit sequences are used to monitor the occurrences of patterns within a sliding window. Two versions of algorithms are proposed by maintaining the appearing bit sequences of maximum repeating patterns and closed repeating patterns, respectively. Accordingly, the cost of re-mining repeating patterns over a sliding window is reduced to that of monitoring frequency changes of the maintained patterns. The experimental results show that the incremental mining methods perform much better than the re-miming approach.
A multidisciplinary approach towards computational thinking for science majors
Authors: Susanne Hambrusch, Christoph Hoffmann, John T. Korb, Mark Haugan, Antony L. Hosking
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper describes the development and initial evaluation of a new course ``Introduction to Computational Thinking'' taken by science majors to fulfill a college computing requirement. The course was developed by computer science faculty in collaboration with science faculty and it focuses on the role of computing and computational principles in scientific inquiry. It uses Python and Python libraries to teach computational thinking via basic programming concepts, data management concepts, simulation, and visualization. Problems with a computational aspect are drawn from different scientific disciplines and are complemented with lectures from faculty in those areas. Our initial evaluation indicates that the problem-driven approach focused on scientific discovery and computational principles increases the student's interest in computing.
Modeling the Interactions of Bottom-Up and Top-Down Guidance in Visual Attention
Authors: David Henderickx, Kathleen Maetens, Thomas Geerinck, Eric Soetens
Venue: Attention in Cognitive Systems: 5th International Workshop on Attention in Cognitive Systems, WAPCV 2008 Fira, Santorini, Greece, May 12, 2008 Revised Selected Papers (2009)

We propose a framework of visual attention grounded on earlier attentional and perceptual models to serve as a basis for the development of computational vision systems. The framework is build on generally established knowledge about the neural basis of human attention, models developed by Briand [1][2], Itti and Koch [3][4], and Wolfe [5][6] and our own results that call for adaptations of the existing models [7][8]. In this paper we concentrate on the interaction of bottom-up and top-down processes to understand the mechanisms underlying exogenous and endogenous attention. Two series of studies are reported to support the proposed adaptation of the earlier models. First, we claim that the visual feature binding is a common process for exogenous and endogenous attention [7]. Secondly, we demonstrate the ability to preset the bottom-up feature maps by demonstrating the phenomenon of Inhibition of Return (IOR) with endogenous cueing, suggesting that IOR affects processing before focusing attention [8].
Career development: a new approach to performance appraisal
Authors: Wallace C. Andrews, Lester J. Sontag
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Ours has been called the age of the "knowledge worker." What this means is that people, especially people who work in high technology industries, have become dramatically more important to the success of those industries than ever before. Company executives, who have long talked about their people as "our most valuable asset", are beginning to really believe it. And that is why managers of professional people are becoming increasingly concerned about finding more effective ways to enhance the performance of these highly trained employes.