ppxscal/embedding_network huggingface dataset:
Web-Based Management of Content Delivery Networks
Authors: George Oikonomou, Theodore Apostolopoulos
Venue: Proceedings of the 19th IFIP/IEEE international workshop on Distributed Systems: Operations and Management: Managing Large-Scale Service Deployment (2008)

Abstract overlay networks have been considered enablers of efficient management for decentralized, large scale service deployments. A Content Delivery Network (CDN) is an example of service falling within this category. The result of our research is WebDMF, a management framework for distributed services based on the Web-Based Enterprise Management (WBEM) family of specifications. Abstract design, combined with a middleware layer of entities called "Representatives", makes WebDMF suitable for the management of a variety of services. Details related to the management of each particular service are detached from the representative logic. This paper discusses how WebDMF can be used for the management of CDNs. A WBEM provider resides on each host participating in the service deployment and implements CDN-specific operations. WebDMF representatives decentralize, unify and coordinate those on a deployment scale. Preliminary measurements on an emulated network topology are also presented as an indication of the solution's viability and scalability.
Research of Sensor Nodes Artificial Arranging and Round-Robin Scheduling Algorithm for Aggregated Surveillance Targets
Authors: Ke-qing Li
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

Coverage problem is a fundmental problem and a NP hard problem in wireless sensor networks (WSN), which influencing directly the quality of service of network systems. Coverage prblem can be divided into three typies, such as point coverage, barrier coverage and area coverage prolem. This paper focuses on analizing the point coverage problem of aritificial arrangement model, and puts forword a sensor nodes artificial arranging algorithm for aggregated surveillance targets and a round-robin scheduling algorithm under the circumstance of whole targets be covered entirely. The simulation calculation results show that both algorithms have lower time of computation than other similar algorithms, and schedule as less nodes as possible in each turn, thus both our algorithms can not only save the amount of sensor nodes at the stage of deployment but also prolong the life time of network systems. 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
MPEG-21: Goals and Achievements
Authors: Ian Burnett, Rik Van de Walle
Venue: IEEE MultiMedia (2003)

MPEG-21 is an open standards-based framework for multimedia delivery and consumption. It aims to enable the use of multimedia resources across a wide range of networks and devices. In this article, we discuss MPEG-21's parts, achievements, ongoing activities, and opportunities for new technologies.
Temporal Logic Query Checking: A Tool for Model Exploration
Authors: Arie Gurfinkel Marsha Chechik
Venue: IEEE Transactions on Software Engineering (2003)

Temporal logic query checking was first introduced by W. Chan in order to speed up design understanding by discovering properties not known a priori. A query is a temporal logic formula containing a special symbol ?_1, known as a placeholder. Given a Kripke structure and a propositional formula \varphi, we say that \varphi satisfies the query if replacing the placeholder by \varphi results in a temporal logic formula satisfied by the Kripke structure. A solution to a temporal logic query on a Kripke structure is the set of all propositional formulas that satisfy the query. Query checking helps discover temporal properties of a system and, as such, is a useful tool for model exploration. In this paper, we show that query checking is applicable to a variety of model exploration tasks, ranging from invariant computation to test case generation. We illustrate these using a Cruise Control System. Additionally, we show that query checking is an instance of a multi-valued model checking of Chechik et al. This approach enables us to build an implementation of a temporal logic query checker, TLQSolver, on top of our existing multi-valued model checker \chi\rm Chek. It also allows us to decide a large class of queries and introduce witnesses for temporal logic queries—an essential notion for effective model exploration.
Programming agents as a means of capturing self-strategy
Authors: Michal Chalamish, David Sarne, Sarit Kraus
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

In this paper we report results of an extensive evaluation of people's ability to reproduce the strategies they use in simple real-life settings. Having the ability to reliably capture people's strategies in different environments is highly desirable in Multi-Agent Systems (MAS). However, as trivial and daily as these strategies are, the process is not straightforward and people often have a different belief of how they act. We describe our experiments in this area, based on the participation of a pool of subjects in four different games with variable complexity and characteristics. The main measure used for determining the closeness between the two types of strategies used is the level of similarity between the actions taken by the participants and those taken by agents they programmed in identical world states. Our results indicate that generally people have the ability to reproduce their game strategies for the class of games we consider. However, this process should be handled carefully as some individuals tend to exhibit a behavior different from the one they program into their agents. The paper evaluates one possible method for enhancing the process of strategy reproduction.
Grid Computing Solutions for Distributed Repositories of Protein Folding and Unfolding Simulations
Authors: Martin Swain, Vitaliy Ostropytskyy, Cândida G. Silva, Frederic Stahl, Olivier Riche, Rui M. Brito, Werner Dubitzky
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

The P-found protein folding and unfolding simulation repository is designed to allow scientists to perform analyses across large, distributed simulation data sets. There are two storage components in P-found: a primary repository of simulation data and a data warehouse. Here we demonstrate how grid technologies can support multiple, distributed P-found installations. In particular we look at two aspects, first how grid data management technologies can be used to access the distributed data warehouses; and secondly, how the grid can be used to transfer analysis programs to the primary repositories --- this is an important and challenging aspect of P-found because the data volumes involved are too large to be centralised. The grid technologies we are developing with the P-found system will allow new large data sets of protein folding simulations to be accessed and analysed in novel ways, with significant potential for enabling new scientific discoveries.
Comparison of Neural Networks Incorporating Partial Monotonicity by Structure
Authors: Alexey Minin, Bernhard Lang
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part II (2008)

Neural networks applied in control loops and safety-critical domains have to meet more requirements than just the overall best function approximation. On the one hand, a small approximation error is required, on the other hand, the smoothness and the monotonicity of selected input-output relations have to be guaranteed. Otherwise the stability of most of the control laws is lost. Three approaches for partially monotonic models are compared in this article, namely Bounded Derivative Network (BDN) [1], Monotonic Multi-Layer Perceptron Network (MONMLP) [2], and Constrained Linear Regression (CLR). Authors investigated the advantages and disadvantages of these approaches related to approximation performance, training of the model and convergence.
Towards Semantic Search
Authors: Ricardo Baeza-Yates, Massimiliano Ciaramita, Peter Mika, Hugo Zaragoza
Venue: Proceedings of the 13th international conference on Natural Language and Information Systems: Applications of Natural Language to Information Systems (2008)

Semantic search seems to be an elusive and fuzzy target to many researchers. One of the reasons is that the task lies in between several areas of specialization. In this extended abstract we review some of the ideas we have been investigating while approaching this problem. First, we present how we understand semantic search, the Web and the current challenges. Second, how to use shallow semantics to improve Web search. Third, how the usage of search engines can capture the implicit semantics encoded in the queries and actions of people. To conclude, we discuss how these ideas can create virtuous feedback circuit for machine learning and, ultimately, better search.
A Citizen's Portal for the City of Bergen
Authors: Lars Marius Garshol
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

In early 2007 the city of Bergen, the second largest city in Norway, launched a new citizen's portal based on Topic Maps. This paper describes the project, the technology used, and some lessons learned from the project.
Design of Intelligent PID Controller Based on Adaptive Genetic Algorithm and Implementation of FPGA
Authors: Liguo Qu, Yourui Huang, Liuyi Ling
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

Now, many systems aretime-varying, nonlinear and real-timein industrial processes.According to PID parameters adjustment problems of these systems, firstly, the paper adopts adaptive genetic algorithm (AGA) to optimize the parameters of PID controller and introduces altera FPGA 1P1C6F256C8 to implement PID controller. Secondly, the closed-loop test system is constructed by DSP builder. At last, TCL script file which is generated by signal compiler is run in modelsim to verify VHDL code which is compiled in Quartus II. The results show that AGA improves the precision of PID parameters optimization and the adaptability of control system, simultaneously demonstrate the feasibility and practicability of intelligent PID controller based on FPGA.
Neighborly Embedded Manifolds
Authors: G. Kalai, A. Wigderson
Venue: Discrete Computational Geometry (2008)

An embedding of an n-dimensional manifold M into R d is called k-neighborly if, for every k points on the embedded manifold, there is a hyperplane H in R d which supports the manifold precisely at these points. Micha A. Perles (Problems presented in Oberwolfach conference on &#x201c;Convexity&#x201d;, [1982]) asked: What is the smallest dimension d(k,n) of the ambient space in which a k-neighborly n-dimensional manifold exists? We prove that d(k,n)&#x2264;2k(k&#x2212;1)n. Related results and open problems are discussed.
Embedded Trusted Computing with Authenticated Non-volatile Memory
Authors: Dries Schellekens, Pim Tuyls, Bart Preneel
Venue: Proceedings of the 1st international conference on Trusted Computing and Trust in Information Technologies: Trusted Computing - Challenges and Applications (2008)

Trusted computing is an emerging technology to improve the trustworthiness of computing platforms. The Trusted Computing Group has proposed specifications for a Trusted Platform Module and a Mobile Trusted Module. One of the key problems when integrating these trusted modules into an embedded system-on-chip design, is the lack of on-chip multiple-time-programmable non-volatile memory. In this paper, we describe a solution to protect the trusted module's persistent state in external memory against non-invasive attacks. We introduce a minimal cryptographic protocol to achieve an authenticated channel between the trusted module and the external non-volatile memory. A MAC algorithm has to be added to the external memory to ensure authenticity. As a case study, we discuss trusted computing on reconfigurable hardware. In order to make our solution applicable to the low-end FPGA series which has no security measures on board, we present a solution that only relies on the reverse engineering complexity of the undocumented bitstream encoding and uses a physically unclonable function for one-time-programmable key storage. Clearly, this solution is also applicable to high-end series with special security measures on board. Our solution also supports field updates of the trusted module.
Implementation of a layer 2 bridge in ns-3
Authors: Eduard Bonada, Darko Cavic, Dolors Sala
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

The main objective of this poster is to show the key points of the ns-3 software architecture in order to modify its internal functionality (e.g. creation of a new module). It is intended for those researchers that want to use ns-3 for their simulations and need more than a simple user level platform.
A Dirichlet-Smoothed Bigram Model for Retrieving Spontaneous Speech
Authors: Matthew Lease, Eugene Charniak
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

We present two simple but effective smoothing techniqes for the standard language model (LM) approach to information retrieval [12]. First, we extend the unigram Dirichlet smoothing technique popular in IR [17] to bigram modeling [16]. Second, we propose a method of collection expansion for more robust estimation of the LM prior, particularly intended for sparse collections. Retrieval experiments on the MALACH archive [9] of automatically transcribed and manually summarized spontaneous speech interviews demonstrates strong overall system performance and the relative contribution of our extensions.
Plan Diagnosis and Agent Diagnosis in Multi-agent Systems
Authors: Roberto Micalizio, Pietro Torasso
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

The paper discusses a distributed approach for monitoring and diagnosing the execution of a plan where concurrent actions are performed by a team of cooperating agents.The paper extends the notion of plan diagnosis(introduced by Roos et al. for the execution of a multi-agent plan) with the notion of agent diagnosis. While plan diagnosis is able to capture the distinction between primary and secondary failures, the agent diagnosis makes apparent the actual health status of the agents.The paper presents a mechanism of failure propagation which captures the interplay between agent diagnosis and plan diagnosis; this mechanism plays a critical role in the understanding at what extent a fault affecting the functionalities of an agent affects the global plan too. A relational formalism is adopted for modeling both the nominal and the abnormal execution of the actions.
Fault Diagnosis of Rotating Machinery Using Data Mining and CLIPS-Based Expert System
Authors: Dongyang Dou, Yingkai Zhao
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

Expert system is widely used in fault diagnosis, but how to obtain knowledge is a bottleneck restricting its development. Data contains rich information about the machine, and acquiring knowledge from it or data mining in other words is considered as an effective way solving this problem. An algorithm based on rough set and genetic algorithm for feature reduction is proposed in this paper. Minimal assemble of necessary features i.e. reduct is computed, from which diagnosis rules can be generated. On the base of the rules discovered, an expert system for fault diagnosis of rotating machinery is presented. It is a production rule-based expert system developed on CLIPS, and realized together with VC++ programming and SQL SERVER database. To validate the diagnosis system, an experiment is carried out in rotor test-bed and further improvement is pointed out.
Least Privilege and More
Authors: Fred B. Schneider
Venue: IEEE Security and Privacy (2003)

With new methods for enforcing security policies comes the opportunity toformulate application-specific policies. But leveraging that flexibility might prove a difficult problem not only in practice, but also in theory.
Content-Based Image Retrieval Using Combined 2D Attribute Pattern Spectra
Authors: Florence Tushabe, Michael. H. Wilkinson
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This work proposes a region-based shape signature that uses a combination of three different types of pattern spectra. The proposed method is inspired by the connected shape filter proposed by Urbach et al. We extract pattern spectra from the red, green and blue color bands of an image then incorporate machine learning techniques for application in photographic image retrieval. Our experiments show that the combined pattern spectrum gives an improvement of approximately 30% in terms of mean average precision and precision at 20 with respect to Urbach et al's method.
Autonomous Decentralized System for Service Assurance and Its Application
Authors: Kinji Mori
Venue: Proceedings of the 4th international symposium on Service Availability (2007)

The market and users requirements have been rapidly changing and diversified. Under these heterogeneous and dynamic situations, not only the system structure itself, but also the accessible information services would be changed constantly. Therefor, the integration of wired and wireless devices, control and information systems to achieve real-time, high-performance and high-reliability for heterogeneous service provision and utilization is becoming more and more important. The Autonomous Decentralized System (ADS) has been proposed for resolving the on-line property to achieve the step-by-step expansion, maintenance and fault-propagation prevention for high-assurance. In this paper, the ADS architecture, autonomous community and application example in the IC card system are discussed.
Multiscale Estimation to the Parameter of Multidimension Time Series
Authors: Cheng-Lin Wen, Guang-Jiang Wang, Chuan-Bo Wen, Zhi-Guo Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III (2007)

During preceding theory study and engineering application, we dealed with the parameter estimation of one-dimension long memory process actually, and rarely take into account high dimensions. There are few papers about it. In this paper, using the decorrelation property of discrete wavelet transform, high dimension situation (mainly 2D) is simplified to 1D and corresponding referrers are improved according to new idea, combining with matrix transform. So the computation complexity is reduced effectively and estimation precision is satisfied. Some experiment results show that this algorithm has a better general performance.
On the polyhedral complexity of the integer points in a hyperball
Authors: Valentin E. Brimkov, Reneta P. Barneva
Venue: Theoretical Computer Science (2008)

Let B^n be a hyperball in R^n, n>=2, and denote B"Z^n=B^n@?Z^n. Define polyhedral facet complexity of B"Z^n as FC(B"Z^n)=min"P{f"n"-"1(P)} where P is an enclosing polyhedron for B"Z^n (i.e., P"Z=P@?Z^n=B"Z^n) and f"n"-"1(P) is the number of the (n-1)-facets of P. Analogously, define polyhedral vertex complexity of B"Z^n as VC(B"Z^n)=min"P{f"0(P)} where P is an enclosing polyhedron for B"Z^n and f"0(P) is the number of the 0-facets (vertices) of P. Upper bounds for FC(B"Z^n) follow from a well-known bound for the number of facets and vertices of the convex hull of B"Z^n [I. Barany, D.G. Larman, The convex hull of the integer points in a large ball, Math. Ann. 312 (1998) 167-181]. In this note we provide the first nontrivial lower bounds on FC(B"Z^n) and VC(B"Z^n).
On Rank and Kernel of Z4-Linear Codes
Authors: Cristina Fernández-Córdoba, Jaume Pujol, Mercè Villanueva
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

A code ${\cal C}$ is a quaternary linear code if ${\cal C}$ is a subgroup of Z. In this paper, the rank and dimension of the kernel for Z4-linear codes, which are the corresponding binary codes of quaternary linear codes, are studied. The possible values of these two parameters for Z4-linear codes, giving lower and upper bounds, are established. For each possible rank r between these bounds, the construction of a Z4-linear code with rank r is given. Equivalently, for each possible dimension of the kernel k, the construction of a Z4-linear code with dimension of the kernel k is given.
Predictive control strategy for image based visual servoing of robot manipulators
Authors: Corneliu Lazar, Adrian Burlacu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Predictive control strategies began to be used to solve the image based visual servoing problems. Thus, in literature, a GPC controller and a nonlinear predictive one were reported. In this paper, a predictive control strategy is developed based on a new approach for computing the feature trajectories prediction of a robot with eye-in-hand configuration. The cost function based on errors in image plane takes into consideration the visibility constrain due to sensor characteristics. Using a visual servoing simulator, the predictive strategy was successfully tested.
Towards Real-Time Authoring of Believable Agents in Interactive Narrative
Authors: Martin Velsen
Venue: Proceedings of the 8th international conference on Intelligent Virtual Agents (2008)

In this paper we present an authoring tool called Narratoria that allows non-technical experts in the field of digital entertainment to create interactive narratives with 3D graphics and multimedia. Narratoria allows experts in digital entertainment to participate in the generation of story-based military training applications. Users of the tools can create story-arcs, screenplays, pedagogical goals and AI models using a single software application. Using commercial game engines, which provide direct visual output in a real-time feedback-loop, authors can view the final product as they edit.
Using Wikipedia Categories and Links in Entity Ranking
Authors: Anne-Marie Vercoustre, Jovan Pehcevski, James A. Thom
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

This paper describes the participation of the INRIA group in the INEX 2007 XML entity ranking and ad hoc tracks. We developed a system for ranking Wikipedia entities in answer to a query. Our approach utilises the known categories, the link structure of Wikipedia, as well as the link co-occurrences with the examples (when provided) to improve the effectiveness of entity ranking. Our experiments on both the training and the testing data sets demonstrate that the use of categories and the link structure of Wikipedia can significantly improve entity retrieval effectiveness. We also use our system for the ad hoc tasks by inferring target categories from the title of the query. The results were worse than when using a full-text search engine, which confirms our hypothesis that ad hoc retrieval and entity retrieval are two different tasks.