ppxscal/embedding_network huggingface dataset:
Semisupervised learning using feature selection based on maximum density subgraphs
Authors: Yoshiyuki Nakatani, Kuangyi Zhu, Kuniaki Uehara
Venue: Systems and Computers in Japan (2007)

In machine learning tasks on large-scale datasets, the labeled data essential to the classification are not always sufficient, which degrades the learning accuracy. Meanwhile, unlabeled data are always abundant. Hence, semisupervised learning which uses both unlabeled and labeled data to improve the learning accuracy is currently of great interest. In this paper, we use a graph to represent the underlying distribution of both labeled and unlabeled data and split it by using multiway cut to classify unlabeled data. Additionally, we propose a graph-based feature selection algorithm to improve the learning accuracy of our graph-based semisupervised learning algorithm. In our algorithm, we first propose an evaluation criterion for the attribute relevance using the graph density. Then, we extract the relevant attribute subset by finding the clique on the graph where each vertex stands for the attribute and each edge stands for the relevance of a feature pair. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 32&ndash;43, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20757
Social and Distributed Cognition in Knowledge Management Systems
Authors: Susan Gasson, Jim Waters
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Many organizations rely on information and communication technologies (ICTs) to provide solutions to the perennial problem of supporting individuals and groups, performing interrelated tasks, who need to coordinate what they know. Yet we have seen many limitations in the use of ICTs to mediate and coordinate distributed and dynamic knowledge sharing. Organizations must grapple with issues such as how partial knowledge is shared across functional and task-related application domains, how knowledge-work practices in different workgroups are defined and coordinated, and how knowledge is embedded in various forms of ICT. These issues are all related to distributed ways of knowing. The papers in this minitrack explore the complexities and synergies of collaborative work, viewed through the lens of distributed and socially-shared cognition.
Pattern Mining in POS Data using a Historical Tree
Authors: Takanobu Nakahara, Hiroyuki Morita
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper, we propose a pattern mining method using POS data. Firstly, we transform raw POS data into tree structured data, extract some promising patterns from it by using a multiobjective evolutionary algorithm (MOEA), and construct a decision tree model using these patterns and customer attributes. From our computational experiments using practical POS data obtained from a supermarket chain in Japan, we show that our method can mine some promising patterns. Further, these patterns are useful for constructing a better decision tree model to identify target customers.
Triangulation on a Reconfigurable Mesh with Buses
Authors: Madhusudan Nigam, Sartaj Sahni
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

We develop an 0(1) time algorithm to a triangulate a set of N planar points using an N×N reconfigurable mesh with buses. Our algorithm works on all reconfigurable mesh with buses architectures.
Specifying Policies Using UML Sequence Diagrams--An Evaluation Based on a Case Study
Authors: Bjornar Solhaug, Dag Elgesem, Ketil Stolen
Venue: Proceedings of the Eighth IEEE International Workshop on Policies for Distributed Systems and Networks (2007)

This paper provides a case study based evaluation of UML sequence diagrams as a notation for policy specification. Policy rules are defined on the basis of deontic logic and provided a trace based semantics interpreted over Kripke structures. This gives a semantics comparable to the UML trace semantics for sequence diagrams, which is utilized in the evaluation. The focus is on requirements with respect to expressivity, utility and human readability.
OSPF monitoring: architecture, design and deployment experience
Authors: Aman Shaikh, Albert Greenberg
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Improving IP control plane (routing) robustness is critical to the creation of reliable and stable IP services. Yet very few tools exist for effective IP route monitoring and management. We describe the architecture, design and deployment of a monitoring system for OSPF, an IP intradomain routing protocol in wide use. The architecture has three components, separating the capture of raw LSAs (Link State Advertisements - OSPF updates), the real-time analysis of the LSA stream for problem detection, and the off-line analysis of OSPF behavior. By speaking "just enough" OSPF, the monitor gains full visibility of LSAs, while remaining totally passive and visible only at the point of attachment. We describe a methodology that allows efficient real-time detection of changes to the OSPF network topology, flapping network elements, LSA storms and anomalous behavior. The real-time analysis capabilities facilitate generation of alerts that operators can use to identify and troubleshoot problems. A flexible and efficient toolkit provides capabilities for off-line analysis of LSA archives. The toolkit enables post-mortem analysis of problems, what-if analysis that can aid in maintenance, planning, and deployment of new services, and overall understanding of OSPF behavior in large networks. We describe our experiences in deploying the OSPF monitor in a large operational ISP backbone and in a large enterprise network, as well as several examples that illustrate the effectiveness of the monitor in tracking changes to the network topology, equipment problems and routing anomalies.
LinLogFS: a log-structured filesystem for Linux
Authors: Christian Czezatke, M. Anton Ertl
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

LinLogFS is a log-structured filesystem for Linux. It currently offers features like fast crash recovery and in-order write semantics. We implemented LinLogFS by putting a logging layer between an adapted version of the ext2 file system and the block device.
Detection of signals in correlated interference using a predictive VA
Authors: K. Vasudevan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

We address the problem of optimally detecting signals in correlated noise using a predictive Viterbi algorithm (PVA). We derive expressions for the probability of error for uncoded systems employing the PVA, which are corrupted by coloured noise. As an application, the PVA is used in conjunction with a fractionally-spaced linear equalizer (LE-PVA), thereby improving the bit-error-rate performance by as much as 11 dB, over the conventional decision feedback equalizer with estimated decisions, when the channel has spectral nulls. Simulation results also show that the performance difference between the LE-PVA and the decision feedback equalizer with correct decisions fed back (ideal DFE), is just 1 dB, even when the channel has spectral nulls. Thus, we clearly demonstrate the superiority of the LE-PVA over a practical DFE.
The Usability of Multimedia Interface Based on User's Mental Models
Authors: Tian Lei, Ying Yang, Yanhe Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The mental model is the root of usabilities of user interfaces. This article, by introducing the methods of Cognitive Psychology and Usabitlity Engineering, makes experiments to explore whether users could encounter difficulties in the mobile phone's multimedia interface when the mental model formed in graphic user interface (GUI) is transferred into multimedia user interface (MUI). Experimental results show that 1) when the icon's medium attributes change from the stactic state in GUI to the animation in MUI, users can't generate conflicts in their minds, and 2) when information's layout on the MUI's 2nd level interface changes from the column usually used in GUI into the lattices consistant with the 1st level interface of MUI, the represention progress of user's mental models will be quicken. Based on these, we think that changing information's layout and adjusting metaphors of interface can improve the usability of MUI.
Block Shanno constant modulus algorithm for wireless equalizations
Authors: Zifei Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We formulate a block processing objective function for the constant modulus algorithm (CMA) and present a nonlinear optimization strategy for its rapid minimization. The resulting algorithm is called the block Shanno constant modulus algorithm (BSCMA), which is applied in the simulation to equalize multipath fading channel models with a multi-antenna system. The results show that the algorithm can converge considerably faster than the steepest descent based CMA and the RLSCMA configured similarly.
An automatic method for summary evaluation using multiple evaluation results by a manual method
Authors: Hidetsugu Nanba, Manabu Okumura
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

To solve a problem of how to evaluate computer-produced summaries, a number of automatic and manual methods have been proposed. Manual methods evaluate summaries correctly, because humans evaluate them, but are costly. On the other hand, automatic methods, which use evaluation tools or programs, are low cost, although these methods cannot evaluate summaries as accurately as manual methods. In this paper, we investigate an automatic evaluation method that can reduce the errors of traditional automatic methods by using several evaluation results obtained manually. We conducted some experiments using the data of the Text Summarization Challenge 2 (TSC-2). A comparison with conventional automatic methods shows that our method outperforms other methods usually used.
Distributed Resource Management and Admission Control of Stream Processing Systems with Max Utility
Authors: Cathy H. Xia, Don Towsley, Chun Zhang
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

A fundamental problem in a large scale decentralized stream processing system is how to best utilize the available resources and admission control the bursty and high volume input streams so as to optimize overall system performance. We consider a distributed stream processing system consisting of a network of servers with heterogeneous capabilities that collectively provide processing services to multiple data streams. Our goal is to design a joint source admission control, data routing, and resource allocation mechanism that maximizes the overall system utility. Here resources include both link bandwidths and processor resources. The problem is formulated as a utility optimization problem. We describe an extended graph representation that unifies both types of resources seamlessly and present a novel scheme that transforms the admission control problem to a routing problem by introducing dummy nodes at sources. We then present a distributed gradient-based algorithm that iteratively updates the local resource allocation based on link data rates. We show that our algorithm guarantees optimality and demonstrate its performance through simulation.
Typed common intermediate format
Authors: Zhong Shao
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Application languages are very effective in solving specific software problems. Unfortunately, they pose great challenges to reliable and efficient implementations. In fact, most existing application languages are slow, interpreted, and have poor interoperability with general-purpose languages. This paper presents a framework on building high-quality systems environment for multiple advanced languages. Our key innovation is the use of a common typed intermediate language, named FLINT, to model the semantics and interactions of various language-specific features. FLINT is based on a predicative variant of the Girard-Reynolds polymorphic calculus Fω, extended with a very rich set of primitive types and functions. FLINT provides a common compiler infrastructure that can be quickly adapted to generate compilers for new general-purpose and domain-specific languages. With its single unified type system, FLINT serves as a great platform for reasoning about cross-language interoperations. FLINT types act as a glue to connect language features that complicate interoperability, such as mixed data representations, multiple function calling conventions, and different memory management protocols. In addition, because all runtime representations are determined by FLINT types, languages compiled under FLINT can share the same system-wide garbage collector and foreign function call interface.
The Role of Quasi-Regular Tetrahedra in Dense Disordered Packings of Hard Spheres
Authors: A. V. Anikeenko, N. N. Medvedev
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

Delaunay simplexes were used for structure analysis of hard sphere packings of different density. A special attention was paid to the simplexes of tetrahedral shape. Clusters of the tetrahedra adjacent by faces represent relatively dense aggregates of spheres atypical for crystalline structures. Such "polytetrahedral" aggregates reveal a characteristic feature of the dense disordered packings. The tetrahedra in point are not completely perfect. They coincide with the class of "quasi-regular tetrahedra" introduced by Hales in his proof of the Kepler conjecture. In this work we discuss a meaning of these tetrahedra and their role in formation of the dense disordered packings. Polytetrahedral principle of a spatial organization seems to be preferable from the statistical viewpoint, as in this case a variety of dense local configurations can be realized. However it has its limit and further increase in density can be provided by formation of crystalline nuclei.
Feedback fuzzy-DVS scheduling of control tasks
Authors: Hong Jin, Danli Wang, Hongan Wang, Hui Wang
Venue: The Journal of Supercomputing (2007)

To consider the energy-aware scheduling problem in computer-controlled systems is necessary to improve the control performance, to use the limited computing resource sufficiently, and to reduce the energy consumption to extend the lifetime of the whole system. In this paper, the scheduling problem of multiple control tasks is discussed based on an adjustable voltage processor. A feedback fuzzy-DVS (dynamic voltage scaling) scheduling architecture is presented by applying technologies of the feedback control and the fuzzy DVS. The simulation results show that, by using the actual utilization as the feedback information to adjust the supply voltage of processor dynamically, the high CPU utilization can be implemented under the precondition of guaranteeing the control performance, whilst the low energy consumption can be achieved as well. The proposed method can be applied to the design in computer-controlled systems based on an adjustable voltage processor.
Clustering Distributed Energy Resources for Large-Scale Demand Management
Authors: Elth Ogston, Astrid Zeman, Mikhail Prokopenko, Geoff James
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Managing demand for electrical energy allows generation facilities to be run more efficiently. Current systems allow for management between large industrial consumers. There is, however, an increasing trend to decentralize energy resource management and push it to the level of individual households, or even appliances. In this work we investigate the suitability of using adaptive clustering to improve the scalability of decentralized energy resource management systems by appropriately partitioning resources. We review the area of distributed energy resource management and propose a simple yet realistic model to study the problem. Simulations using this model show that straightforward clustering and distributed planning methods allow systems to scale, but may be limited to only a few hundredthousand appliances. Results indicate that there is an opportunity to apply adaptive clustering techniques in order to discover more advanced grouping criteria that would enable groups to change as appliances' behavior changes. The simulations further suggest that even an extremely limited exchange of information between clusters can greatly improve management solutions.
Exploiting Heterogeneity for Collective Data Downloading in Volunteer-based Networks
Authors: Jinoh Kim, Abhishek Chandra, Jon Weissman
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Scientific computing is being increasingly deployed over volunteer-based distributed computing environments consisting of idle resources on donated user machines. A fundamental challenge in these environments is the dissemination of data to the computation nodes, with the successful completion of jobs being driven by the efficiency of collective data download across compute nodes, and not only the individual download times. This paper considers the use of a data network consisting of data distributed across a set of data servers, and focuses on the server selection problem: how do individual nodes select a server for downloading data to minimize the communication makespan the maximal download time for a data file. Through experiments conducted on a Pastry network running on PlanetLab, we demonstrate that nodes in a volunteer-based network are heterogeneous in terms of several metrics, such as bandwidth, load, and capacity, which impact their download behavior. We propose new server selection heuristics that incorporate these metrics, and demonstrate that these heuristics outperform traditional proximity-based server selection, reducing average makespans by at least 30%. We further show that incorporating information about download concurrency avoids overloading servers, and improves performance by about 17-43% over heuristics considering only proximity and bandwidth.
Agent based control and monitoring system for dynamic reallocation of loads in a limited power supply scenario
Authors: Ferdinanda Ponci
Venue:  (2006)

The monitoring and control of complex power systems with limited power generation capability is a topic of growing interest. Mobile power applications, such as ships and aircrafts, as well as hybrid systems, powered by alternative energy sources, belong to this category. This dissertation is aimed at providing a platform to build an advanced monitoring and diagnostic system for the complex power system in a limited power supply scenario. In particular the system in focus is the power distribution system of the all electric ship of the US Navy. Considering the distributed nature of the power system to be controlled and the requirement of an autonomous, rigid and a localized control system, the work presents the use of multi-agent systems to provide a solution to the problem. This dissertation introduces the integration of advanced simulation and data acquisition features within the multi-agent system framework to develop a distributed, localized control and monitoring system for complex power electronics applications. The effort is in the direction to develop an agent based system that is independent of the hierarchical structure of master and slaves, with the purpose of achieve maximum flexibility and robustness in case part of the system is lost. With the effort of developing the MAS for control and monitoring power systems, this dissertation also presents the advances in simulation tools for power electronics and the inception of the concept of co-simulation in the agent environment.
A computationally efficient cochlear filter bank for perceptual audio coding
Authors: F. Baumgarte
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Many applications in auditory modeling require analysis filters that approximate the frequency selectivity given by psychophysical data, e.g., from masking experiments using narrow-band maskers. This frequency selectivity is largely determined by the spectral decomposition process inside the human cochlea. Currently used spectral decomposition schemes for masking modeling in audio coding generally do not achieve the non-uniform time and frequency resolution provided by the cochlea. These applications rather take advantage of the computational efficiency of uniform filter banks or transforms at the expense of coding gain. This paper presents a suitable analysis filter-bank structure employing cascaded low-order IIR filters and appropriate downsampling to increase efficiency. In an application example, the filter responses were optimized to model auditory masking effects. The results show that the time and frequency resolution of the filter bank matches or exceeds the masking properties. Thus, the filter bank enables improved masking modeling for audio coding at low computational costs. 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
Boundedness and exponential stability for nonautonomous RCNNs with distributed delays
Authors: Xuyang Lou, Baotong Cui
Venue: Computers Mathematics with Applications (2007)

Some sufficient conditions for the ultimate boundedness and global exponential stability of a class of nonautonomous reaction-diffusion cellular neural networks (RCNNs) with distributed delays are obtained by means of the Lyapunov functional method. Without assuming that the activation functions f"i"j"l(@?) are bounded, the results extend and improve the earlier publications.
Energy-Aware Virtual Backbone Tree for Efficient Routing in Wireless Sensor Networks
Authors: Tamaghna Acharya, Samiran Chattopadhyay, Rajarshi Roy
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Virtual backbone has been proposed recently for provisioning an efficient communication infrastructure in energy constrained wireless sensor network. In this paper, a distributed algorithm is proposed for constructing a Energy - aware Virtual Backbone Tree (EVBT) for general-purpose communication in wireless sensor network. What distinguishes our algorithm from others is that it chooses only nodes with adequate energy levels (energy level above threshold) as the member of the virtual backbone. Simulation results show that size of the EVBT is always much smaller compared to other prominent schemes. This will greatly reduce the protocol overhead. It also shows that algorithm performs competitively with others in terms total energy consumption for data delivery along the tree. The use of multiple nodes disjoint EVBTs further improves the robustness of the communication infrastructure.
Evolving crushers
Authors: P. Hingston, L. Barone, L. While
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper describes the use of an evolutionary algorithm to solve an engineering design problem. The problem involves determining the geometry and operating settings for a crusher in a comminution circuit for ore processing. The intention is to provide a tool for consulting engineers that can be used to explore candidate designs for various scenarios. The algorithm has proved capable of deriving designs that are clearly superior to existing designs, promising significant financial benefits.