ppxscal/embedding_network huggingface dataset:
Reconciling ontological differences by assistant agents
Authors: Kendall Lister, Leon Sterling, Kuldar Taveter
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

In this paper, we propose an alternative solution for approaching the problem of semantic interoperability, based on recent projects to develop software agents and systems that attempt to reconcile ontological differences without explicit formal ontologies. An application capable of reconciling ontologies based on example data is first described. The results from one of the case studies where the proposed solution has been applied are reported. Finally, the design of an agent embedding the solution is sketched. The solution is aimed at the creation of assistant agents helping the users to cope with heterogeneity in both information sources and contexts of their usage.
IAC: Interest-Aware Caching for Unstructured P2P
Authors: Xucheng Luo, Zhiguang Qin, Ji Geng, Jiaqing Luo
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The simplicity and robustness of unstructured P2P system make it a preferable architecture for constructing real large scale file sharing system. Most of the existing paradigms require more overhead. The trace data analysis shows that the workloads among peers are correlated. The bigger the intersection of workloads, the higher the probability that they share other files is. By exploiting such principle, we propose IAC, an interest-aware resource advertisement caching paradigm for unstructured p2p system. Each peer advertises its resource list. If a peer is interested in the resource advertisement received, it then caches the advertisement. Through local cache search, usually the peer gets more than 50% success rate. If local cache search is failed, the random walk-based search is used. The simulations show that as to the same hit rate, the maintenance and search overheads are low and the search delay is very low.
Book Reviews: NoC, NoC ... Who's there?
Authors: Grant Martin
Venue: IEEE Design Test (2006)

This is a review of Networks on Chips: Technology and Tools, by Giovanni De Micheli and Luca Benini. This comprehensive survey and integrated reference work on networks on chips (NoCs) offers both breadth in covering most of the major work in this area and depth in delving into all the related issues involved in designing advanced on-chip interconnect networks.
Duplicate Record Detection: A Survey
Authors: Ahmed K. Elmagarmid, Panagiotis G. Ipeirotis, Vassilios S. Verykios
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Often, in the real world, entities have two or more representations in databases. Duplicate records do not share a common key and/or they contain errors that make duplicate matching a difficult task. Errors are introduced as the result of transcription errors, incomplete information, lack of standard formats, or any combination of these factors. In this paper, we present a thorough analysis of the literature on duplicate record detection. We cover similarity metrics that are commonly used to detect similar field entries, and we present an extensive set of duplicate detection algorithms that can detect approximately duplicate records in a database. We also cover multiple techniques for improving the efficiency and scalability of approximate duplicate detection algorithms. We conclude with coverage of existing tools and with a brief discussion of the big open problems in the area.
Structure Learning of a Behavior Network for Context Dependent Adaptability
Authors: Xiaolin Hu, Ou Li
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

One mechanism for an intelligent agent to adapt to substantial environmental changes is to change the structure of its behavior network. In earlier work, we developed a context-dependent behavior selection architecture that uses structure change as the main mechanism to generate different behavior patterns according to different behavioral contexts. This paper investigates how the structure of such a behavior network can be learned. We present a structure learning method based on generic algorithm (GA). The results show that given a particular dynamic environment, consistent and robust structure can be learned to allow an agent to behave adaptively.
The Development of 3D Multimedia Learning Tool(MLTBS) in Information Communication Technology (ICT) for Teaching and Learning Purposes
Authors: Amirrudin Kamsin, Mohd Yusof Hj Abdullah
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Nowadays, as biology has been taught at schools for years, the teachers have been facing a problem on how to get the students to fully understand the human biology. Of course a student can explain what a skull is, based on the books that he or she has read, but does he or she truly know what a skull looks like. Has he or she touched one? Examine it closely. And not only that, the current method of teaching biology is too static and boring. The teachers teach, and the students listen to it. There has to be some way to change this. The learning tool that has been developed here is called "Interactive 3D Multimedia Learning Tool in Biology - Skeleton", took the advantages from the full-grown potential of Multimedia and 3D Animations. The main goal of this CD-ROM platform product is as a tool that will be able to teach the users what skeleton system is, its functions and know exactly how the bones look like in a very dynamic and interactive method. This courseware will effectively communicate the subject for teachers as well as students to understand and stimulate their interest in the teaching and learning process. The MLTB-Skeleton contains a lot of multimedia elements, such as text, image, video and audio. But most importantly, MLTBSkeleton also contains interactive 3D models that the users can interact with. From the point of system architecture, this system is design with a user friendly interface that is interesting and easy to understand. Its main function is to teach the users about the human skeleton system in an interesting and interactive way.
A Novel Switched Parasitic Array and Diversity Scheme Using Horizontally Polarized Linear Antennas
Authors: Stelios A. Mitilineos, Anna E. Andreoudi, Christos N. Capsalis
Venue: Wireless Personal Communications: An International Journal (2006)

Switched Parasitic Arrays (SPAs) are proposed as an attractive alternative to fully adaptive arrays, due to their compact size and significantly lower cost of development. The main concept of SPAs is the deployment of switches on parasitic elements, which can be properly adjusted, in order to effectively control the radiation pattern of one active element. Conventional SPAs consist of circular arrays of vertically polarized dipoles and parasitic elements. In this paper, a novel SPA design is proposed, which is based on multiple switches employed on the body of horizontally polarized elements (one active and two parasitics). Design considerations are discussed and numerical results are illustrated. Furthermore, a simple diversity scheme is proposed, based on the novel SPA design. Superior performance of the proposed array, relative to simple non-diversity reception schemes, is indicated by simulation results.
A video streaming system for mobile phones: practice and experience
Authors: Hojung Cha, Jongmin Lee, Jongho Nang, Sung-Yong Park, Jin-Hwan Jeong, Chuck Yoo, Jin-Young Choi
Venue: Wireless Networks (2005)

This paper presents a case of video streaming system for mobile phone which has actually been implemented and deployed for commercial services in CDMA2000 1X cellular phone networks. As the computing environment and the network connection of cellular phones are significantly different from the wired desktop environment, the traditional desktop streaming method is not applicable. Therefore, a new architecture is required to suit the successfully streaming in the mobile phone environment. We have developed a very lightweight video player for use in mobile phone and the related authoring tool for the player. The streaming server has carefully been designed to provide high efficiency, reliability and scalability. Based on a specifically-designed suite of streaming protocol, the server employs an adaptive rate control mechanism which transmits the media packets appropriately into the network according to the change in network bandwidth.
PORTAM: Policy, Requirements and Threats Analyzer for Mobile Code Application
Authors: Haruhiko Kaiya, Kouta Sasaki, Kenji Kaijiri
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Users and providers of an information system should clearly understand the threats caused by the system as well as clarify the requirements for the system before they use the system. Especially, they should be very careful when they use a system with components and/or services provided by third parties. However, there are few methods or tools to learn and confirm such issues. In this paper, we present a supporting tool called "PORTAM" for such users and providers to understand the threats and the requirements. Suppose some requirements cannot be satisfied when some threats are avoided, and vice versa. In such cases, they should decide whether the requirements should be satisfied or the threats should be avoided. The tool also helps them to decide such kinds of trade-offs. Current version of this tool handles Java mobile code applications, thus users of our tool can easily feel real threats. Although the current version deals only with Java components, the ideas behind the tool can be applied to software in general. We finally report experimental results to confirm the usefulness and the educational effects of this tool.
Property Analysis of Heavy-tailed Traffic by Simulator
Authors: Takuo Nakashima, Akari Ono
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The scale-invariant burstiness or self-similarity has been found in real network. Relation between selfsimilarity and network and/or system parameter is mainly discussed in the context of end-to-end data transmission environment, and this self-similarity is mainly caused by the file size of Web servers or the duration of user sessions On the other hand, the accesses to Web servers are not uniformly distributed, but are confined to specific Web servers such as search engine sites or portal sites, and other elements of network parameters are not clearly described in the context of self-similarity. In this paper, we have investigated the property of self-similar traffic varying the network environment using the network simulator. After analyzing the simulated results, following properties were extracted. Firstly, heavy-tailed distribution of file size induces self-similarity, especially in the case of small á. Secondly, distribution with power law of data rate emphasize self-similarity. Finally, greater error rate induces to activate the fluctuation of the throughput, and remains self-similar property.
Viewpoints Merging via Incrementally Elicited Ranked Structures
Authors: Aditya Ghose, Qiuming Lin
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Handling inconsistent requirements specifications remains a difficult challenge for the requirements engineering community. This paper seeks to apply techniques developed in the belief merging literature within AI to this problem. The application is non-trivial, since many belief merging operations cannot be directly applied, but must be modified to make them usable in practical settings. We address the problem of merging state model viewpoints, and improve on previous work by Chechik and Easterbrook. We develop a variant of the belief merging framework developed by Meyer et al, which we refer to as the framework of incrementally elicited ranked structures. We show that viewpoint merging within this framework is relatively easy and provides meaningful results.
CONMan: taking the complexity out of network management
Authors: Hitesh Ballani, Paul Francis
Venue: Proceedings of the 2006 SIGCOMM workshop on Internet network management (2006)

Network management is difficult, costly, and error prone, and this is becoming more so as network complexity increases. We argue that this is an outcome of two fundamental flaws in the existing architecture: the management plane depends on the data plane, and network device management interfaces are varied, complex, and constantly evolving. In this paper, we present Complexity Oblivious Network Management (CONMan), a network architecture in which the management plane does not depend on the data plane and all data plane protocols expose a simple generic management interface. This restricts the operational complexity of protocols to their implementation and allows the management plane to achieve high level policies in a structured fashion.
Low-Weight Polynomial Form Integers for Efficient Modular Multiplication
Authors: Jaewook Chung, M. Anwar Hasan
Venue: IEEE Transactions on Computers (2007)

In 1999, Solinas introduced families of moduli called the generalized Mersenne numbers (GMNs), which are expressed in low-weight polynomial form, p = f(t), where t is limited to a power of 2. GMNs are very useful in elliptic curve cryptosystems over prime fields since modular reduction by a GMN requires only integer additions and subtractions. However, since there are not many GMNs and each GMN requires a dedicated implementation, GMNs are hardly useful for other cryptosystems. Here, we modify GMN by removing restriction on the choice of t and restricting the coefficients of f(t) to 0 and \pm1. We call such families of moduli low-weight polynomial form integers (LWPFIs). We show an efficient modular multiplication method using LWPFI moduli. LWPFIs allow general implementation and there exist many LWPFI moduli. One may consider LWPFIs as a trade-off between general integers and GMNs.
Controlled phase synchronization in oscillatory networks
Authors: V. N. Belykh, G. V. Osipov, J. Kurths
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

We propose a method of automatic phase locking of regular and chaotic non-identical oscillations. Our approach is based on the principles of feedback control which implicitly play the role of an internal self-organization mechanism in the huge variety of natural oscillators and which explicitly serve as the basis of phase locked loops. This way phase synchronization via phase locking is achieved for very low coupling and this is demonstrated for several examples: (1) two coupled regular oscillators, (2) coupled regular and chaotic oscillators, (3) two coupled chaotic oscillators, (4) ensembles of locally coupled regular oscillators, (5) ensembles of locally coupled chaotic oscillators, and (6) ensembles of globally coupled chaotic oscillators.
ASEKS: A P2P Audio Search Engine Based on Keyword Spotting
Authors: Ruizhi Ye, Yingchun Yang, Zhenyu Shan, Yiyan Liu, Sen Zhou
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Currently, most search engines are text-based and their structures are centralized. These kinds of engine are sufficient for searching text information in Internet. However, while searching audio resource, an efficient content-based audio search engine is required. In this paper, we demonstrate an audio search engine ASEKS based on keyword spotting technology in the peer-to-peer (P2P) network. The indexing sub-model spots information in local audio files and generates indices for later query; and the P2P networks distributes the query and gathers the results. ASEKS supports scalability and avoids the bottleneck of network load that usually exists in centralized architecture. The average accuracy of the keyword spotting sub-model is 88.4% in detection rate on the 5.267 false alarm per keyword per hour.
Semi-closed cube: an effective approach to trading off data cube size and query response time
Authors: Sheng-En Li, Shan Wang
Venue: Journal of Computer Science and Technology (2005)

The results of data cube will occupy huge amount of disk space when the base table is of a large number of attributes. A new type of data cube, compact data cube like condensed cube and quotient cube, was proposed to solve the problem. It compresses data cube dramatically. However, its query cost is so high that it cannot be used in most applications. This paper introduces the semi-closed cube to reduce the size of data cube and achieve almost the same query response time as the data cube does. Semi-closed cube is a generalization of condensed cube and quotient cube and is constructed from a quotient cube. When the query cost of quotient cube is higher than a given threshold, semi-closed cube selects some views and picks a fellow for each of them. All the tuples of those views are materialized except those closed by their fellows. To find a tuple of those views, users only need to scan the view and its fellow. Thus, their query performance is improved. Experiments were conducted using a real-world data set. The results show that semi-closed cube is an effective approach of data cube.
Delineating Necessary and Sufficient Neural Systems with Functional Imaging Studies of Neuropsychological Patients
Authors: C. J. Price, C. J. Mummery, C. J. Moore, R. S. J. Frackowiak, K. J. Friston
Venue: Journal of Cognitive Neuroscience (1999)

This paper demonstrates how functional imaging studies of neuropsychological patients can provide a way of determining which areas in a cognitive network are jointly necessary and sufficient. The approach is illustrated with an investigation of the neural system underlying semantic similarity judgments. Functional neuroimaging demonstrates that normal subjects activate left temporal, parietal, and inferior frontal cortices during this task relative to physical size judgments. Neuropsychology demonstrates that damage to the temporal and parietal regions results in semantic deficits, indicating that these areas are necessary for task performance. In contrast, damage to the inferior frontal cortex does not impair task performance, indicating that the inferior frontal cortex might not be necessary. However, there are two other possible accounts of intact performance following frontal lobe damage: (1) there is functional reorganization involving the right frontal cortex and (2) there is peri-infarct activity around the damaged left-hemisphere tissue. Functional imaging of the patient is required to discount these possibilities. We investigated a patient (SW), who was able to associate words and pictures on the basis of semantic relationships despite extensive damage to the left frontal, inferior parietal, and superior temporal cortices. Although SW showed peri-infarct activation in left extrasylvian temporal cortices, no activity was observed in either left or right inferior frontal cortices. These findings demonstrate that activity in extrasylvian temporo-parietal and medial superior frontal regions is sufficient to perform semantic similarity judgments. In contrast, the left inferior frontal activations detected in each control subject appear not to be necessary for task performance. In conclusion, necessary and sufficient brain systems can be delineated by functional imaging of brain-damaged patients who are not functionally impaired.
Potential modeling and simulation applications of the web ontology language - OWL
Authors: Lee Lacy, William Gerber
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The Semantic Web is an evolution of the current world-wide web that provides explicit semantics that enable software applications to better process information representations. The Web Ontology Language -- OWL -- is a new language for representing information on the Semantic Web. Modeling and simulation (M&S) applications have many information representation challenges. Examples of M&S data include data tables from authoritative data sources, behaviors for computer generated forces, and descriptions of units and entities to be simulated. OWL provides a consistent syntax using the Resource Description Framework (RDF) and predefined constructs with standard semantics. These features enable better information sharing and support reasoning by inferencing systems. OWL is best used for representing object-oriented descriptions of items in a well-defined domain. It could be used in the M&S community to support distributed representations of data, behaviors, descriptions of units and objects to be simulated, and scenarios with initial conditions.
The Partitioned Scheduling of Sporadic Tasks According to Static-Priorities
Authors: Nathan Fisher, Sanjoy Baruah, Theodore P. Baker
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduling on each individual processor. Since the partitioning problem is easily seen to be NP-hard in the strong sense, this algorithm is not optimal. A quantitative characterization of its worst-case performance is provided in terms of sufficient conditions and resource augmentation approximation bounds. The partitioning algorithm is also evaluated over randomly generated task systems.
Improving resource utilisation in market oriented grid management and scheduling
Authors: Kris Bubendorfer
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Service providers of the future could dynamically negotiate for, and create their infrastructure on Grid based utility computing and communication providers. Such commercialisation of large scale gridsystems requires the provision of mechanisms to share the wide pool of Grid brokered resources such as computers, software, licences and peripherals amongst many users and organisations. Quickly and efficiently servicing resource requests is critical to the efficiency of such Grid based utility computing and communication providers. However, distributed resource negotiation is itself a contributor to lower system utilisation, as the negotiation process introduces latency and reservation uncertainty in the system. The CORA architecture is a market based resource negotiation system that utilises a Vickrey auction to make allocations of resource requests to resource providers. The architecture utilises a novel combination techniques to improve utilisation, including oversubscription, coallocation, just-in-time reallocation and a novel exible contract structure. This paper introduces two significant improvements to the CORA architecture. Firstly, redundant contracts are generated to resolve the problem of post bid unavailability of bidders. Secondly, this paper utilises a new auction architecture that does not require the auctioneer to be trusted. The advantage is that any entity (untrusted or otherwise) can conduct a verifiable and privacy preserving Vickrey auction, removing the need for a trusted and privileged auctioneer within the system