ppxscal/embedding_network huggingface dataset:
DECODE: a new method for discovering clusters of different densities in spatial data
Authors: Tao Pei, Ajay Jasra, David J. Hand, A. -Xing Zhu, Chenghu Zhou
Venue: Data Mining and Knowledge Discovery (2009)

When clusters with different densities and noise lie in a spatial point set, the major obstacle to classifying these data is the determination of the thresholds for classification, which may form a series of bins for allocating each point to different clusters. Much of the previous work has adopted a model-based approach, but is either incapable of estimating the thresholds in an automatic way, or limited to only two point processes, i.e. noise and clusters with the same density. In this paper, we present a new density-based cluster method (DECODE), in which a spatial data set is presumed to consist of different point processes and clusters with different densities belong to different point processes. DECODE is based upon a reversible jump Markov Chain Monte Carlo (MCMC) strategy and divided into three steps. The first step is to map each point in the data to its mth nearest distance, which is referred to as the distance between a point and its mth nearest neighbor. In the second step, classification thresholds are determined via a reversible jump MCMC strategy. In the third step, clusters are formed by spatially connecting the points whose mth nearest distances fall into a particular bin defined by the thresholds. Four experiments, including two simulated data sets and two seismic data sets, are used to evaluate the algorithm. Results on simulated data show that our approach is capable of discovering the clusters automatically. Results on seismic data suggest that the clustered earthquakes, identified by DECODE, either imply the epicenters of forthcoming strong earthquakes or indicate the areas with the most intensive seismicity, this is consistent with the tectonic states and estimated stress distribution in the associated areas. The comparison between DECODE and other state-of-the-art methods, such as DBSCAN, OPTICS and Wavelet Cluster, illustrates the contribution of our approach: although DECODE can be computationally expensive, it is capable of identifying the number of point processes and simultaneously estimating the classification thresholds with little prior knowledge.
Optimal actions in problems with convex loss functions
Authors: J. P. Arias-Nicolás, J. Martín, F. Ruggeri, A. Suárez-Llorens
Venue: International Journal of Approximate Reasoning (2009)

Researches in Bayesian sensitivity analysis and robustness have mainly dealt with the computation of the range of some quantities of interest when the prior distribution varies in some class. Recently, researchers' attention turned to the loss function, mostly to the changes in posterior expected loss and optimal actions. In particular, the search for optimal actions under classes of priors and/or loss functions has lead, as a first approximation, to consider the set of nondominated actions. However, this set is often too big to take it as the solution of the decision problem and some criteria are needed to choose an optimal alternative within the nondominated set. Some authors recommended to choose the conditional @C-minimax or the posterior regret @C-minimax alternative within the set of all possible alternatives. These criteria are quite controversial since they could lead to actions with huge relative increase in posterior expected loss with respect to Bayes actions. To overcome such drawback, we propose a new method, based on the smallest relative error, to choose the least sensitive action and to discriminate alternatives within the nondominated set when the decision maker is interested in diminishing the relative error. We study how to compute the least sensitive action when we consider classes of convex loss functions. Furthermore, we obtain its relation with other proposed solutions: nondominated, minimax and posterior regret minimax actions. We conclude the paper with an example on the estimation of the mean of a Poisson distribution.
Abstraction, Aggregation and Recursion for Accurate and Simple Classifiers: Research on Three Methodologies to Improve the Accuracy and Compactness of ... Abstraction, Aggregation, and Recursion
Authors: Dae-Ki Kang
Venue:  (2008)

In a typical inductive learning scenario, instances in a data set are simply represented as ordered tuples of attribute values. In my research, I explore three methodologies to improve the accuracy and compactness of the classifiers: abstraction, aggregation, and recursion.Firstly, abstraction is aimed at the design and analysis of algorithms that generate and deal with taxonomies for the construction of compact and robust classifiers. Secondly, I apply aggregation method to constructively invent features in a multiset representation for classification tasks. Finally, I construct a set of classifiers by recursive application of weak learning algorithms. Experimental results on various benchmark data sets indicate that the proposed methodologies are useful in constructing simpler and more accurate classifiers.
The effectiveness of synchronous computer-mediated communication for solving hidden-profile problems: Further empirical evidence
Authors: David S. Kerr, Uday S. Murthy
Venue: Information and Management (2009)

We experimentally compared the effectiveness of face-to-face (FTF) and synchronous computer-mediated communication when using a chat tool in solving hidden-profile business problems. In such problems, information critical to its solution is dispersed among team members and they must share it to solve the problem. Unlike prior research using hidden-profile tasks, our study used a real-world business-oriented task, established real rather than ad hoc teams, and imposed a time constraint on them. Hypotheses derived from media richness theory were found to be supported, with the results revealing that computer-mediated teams using the chat tool were less successful in exchanging and processing information than FTF teams and were thus less successful at solving the hidden-profile problem. The results also showed that, when operating under a time constraint, FTF was preferred over computer-mediated communication due to the relative immediacy of feedback and multiplicity of cues available in the FTF setting, as media richness theory predicted.
Power distribution paths in 3-D ICS
Authors: Vasilis F. Pavlidis, Giovanni De Micheli
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Distributing power and ground to a vertically integrated system is a complex and difficult task. Interplane communication and power delivery are achieved by through silicon vias (TSVs) in most of the manufacturing techniques for three-dimensional (3-D) circuits. As shown in this paper, these vertical interconnects provide additional low impedance paths for distributing power and ground within a 3-D circuit. These paths, however, have not been considered in the design process of 3-D power and ground distribution networks. By exploiting these additional paths, the IR drop within each plane is reduced. Alternatively, the routing congestion caused by the TSVs can be decreased by removing stacks of metal vias that are used within a power distribution network. Additionally, the required decoupling capacitance for a circuit can be reduced, resulting in significant savings in area. Case studies of power grids demonstrate a significant reduction of 22% in the number of intraplane vias. Alternatively, a 25% decrease in the decoupling capacitance can be achieved.
Analysis of Multichannel Texture Representations from Video Mosaics
Authors: B. Levienaise-Obadia, J. Kittler, A. Griffin
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Video mosaics have been recently suggested as alternatives to key-frames for indexing video sequences in large video databases. In this paper we demonstrate, that mosaicing techniques affect the textural content of the original sequence. Consequently the annotations derived during indexing may also be affected. In particular, the high frequency content of the representation may not only reflect the high frequency content of the original sequence but also vertical stitches generated by the mosaicing process. Our experimental results also indicate that the processing used to combine the overlapping images (e.g. averaging) tends to destroy textural information. Eventually, we suggest that mosaics constructed without averaging but from a subsampled sequence are a better alternative for video annotations. As a result, we also stress the importance of the accurate registration and alignment of the images.
Miniature Optical Terminals
Authors: Reinhard H. Czichy
Venue: Space Communications (1998)

Inter-Satellite Links (ISL&rsquo;s) will become important elements for the architecture of the future in-orbit communications infrastructure. Various application scenarios for optical ISL&rsquo;s will be discussed and the associated system/terminal requirements will be outlined. The basic design considerations influencing an optical ISL design will be recalled and some promising concepts for high data rate miniature terminals will be identified. The design of a Miniature Optical Terminal for data rates of $>$ 1 Gbps will be presented and possible in-orbit demonstration scenarios will be discussed.
Programming grid: a computer-aided education system for programming courses based on online judge
Authors: Yingwei Luo, Xiaolin Wang, Zhengyi Zhang
Venue: Proceedings of the 1st ACM Summit on Computing Education in China on First ACM Summit on Computing Education in China (2008)

Based on POJ (PKU Judge Online), an online judge system for ACM/ICPC in Peking University, we develop a system called Programming Grid (PG), which is aimed at computer-aided education (CAE) for programming courses. PG is a course-centered system for CAE, while POJ is a problem-centered system for programming training. PG system designs many resources to support programming courses: problem, problem list, digest, course, etc. Based on those resources, PG supports many computer-aided education methods. The teachers and the students can use PG to solve problems, submit source codes and check their answers, download the courseware, compare scores with others, ask questions, and communicate with each others for education aim. Our practice on the course "Introduction to Computing" in PKU proves that PG is useful for computer-aided education for computer programming courses.
A Simulation Analysis of Routing Misbehaviour in Mobile Ad Hoc Networks
Authors: Abdelaziz Babakhouya, Yacine Challal, Abdelmadjid Bouabdallah
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Mobile Ad hoc Networks (MANETs) rely on the cooperation of all participating nodes to provide the fundamental operations such as routing and data forwarding. However, misbehaving nodes may not follow the cooperation paradigm and cause a serious affect on network performance. Nodes misbehave because they are malicious, selfish or malfunctioning. In this paper, we present a simulation study of the effects of misbehaving nodes on DSR routing protocol performances and discuss some countermeasures to mitigate misbehaving node effects.
Research on Gas Explosion IDSS in Coalmines Based on CBR
Authors: Wang Li, Tian Shui-cheng, Yuan Xiao-fang, Ma Xian-min
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

The coalmine gas hazard affected safety of China coalmine production most. As there were lots of complicated and uncertain factors during gas accidents emergency rescue and making decisions process, accurate decisions can not be drawn by mathematics models with present information monitored by the KJ series monitoring systems such as KJ90, so experiences of former questions were urgently required to help as assistant decision-making. Accordingly, the construction of gas explosion intelligent decision support systems (IDSS) based on an artificial intelligence method CBA (Case-Based Reasoning) was put forward. The paper instructed the working flow of CBR as well as main structure of gas explosion early warning intelligent decision support systems, and then it designed representation methods of gas explosion cases, arithmetic of cases retrieval and cases learning process. It had great significance of preventing gas explosion accidents in coalmines as well as providing intelligent decision-making support for emergency rescue.
Cascade fuzzy variable structure control of induction motor based on the approach of fuzzy modelling of Ben-Ghalia
Authors: L. Barazane, P. Sicard, R. Ouiguini
Venue: International Journal of Systems Science (2009)

In this article, a control design concept using fuzzy sets for an induction motor is presented. The aim of the proposed modelling approach is to provide a fuzzy set-based representation of the cascade sliding mode control of an induction motor fed by PWM voltage source inverter, which operates in a fixed reference frame. For this purpose, a new decoupled and reduced model is first proposed. Then, a set of simple surfaces and associated control laws are synthesised. A piecewise smooth control function with a threshold is adopted. However, the magnitude of this function depends closely on the upper bound of uncertainties, which include parameter variations and external disturbances. This bound is difficult to obtain prior to motor operation. To solve this problem, a fuzzy modelling approach is presented to improve the design and tuning of a fuzzy logic controller using variable structure control theory. The robust fuzzy control design is made feasible without resorting to model simplification or imposing restrictive conditions on the system uncertainty. The fuzzy controller is designed in order to improve the control performances and to reduce the control energy and the chattering phenomenon. Simulation results reveal some very interesting features and show that the proposed fuzzy sliding mode controller could be considered as an alternative to the conventional sliding mode control of induction motors.
The Evolution to Network Storage Architectures for Multimedia Applications
Authors: Aloke Guha
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper we review and analyze different approaches to designing storage architectures for multimedia applications. We specifically examine scalability and cost of video on demand systems. By examining trends in storage technologies, we note the cost advantages of using hierarchical storage that include both secondary and tertiary storage devices over purely disk based video servers. Finally, we show how using emerging storage area networks allows us to scale both the video content capacity as well as the number of video streams supported. 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
And Then There Were Three
Authors: Abbe Mowshowitz, Nanda Kumar
Venue: Computer (2009)

Search engine consolidation raises the specter of biased information and free speech abridgement that only increased competition or government regulation can avert.
A new self-stabilizing maximal matching algorithm
Authors: Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil
Venue: Theoretical Computer Science (2009)

The maximal matching problem has received considerable attention in the self-stabilizing community. Previous work has given several self-stabilizing algorithms that solve the problem for both the adversarial and the fair distributed daemon, the sequential adversarial daemon, as well as the synchronous daemon. In the following we present a single self-stabilizing algorithm for this problem that unites all of these algorithms in that it has the same time complexity as the previous best algorithms for the sequential adversarial, the distributed fair, and the synchronous daemon. In addition, the algorithm improves the previous best time complexities for the distributed adversarial daemon from O(n^2) and O(@dm) to O(m) where n is the number of processes, m is the number of edges, and @d is the maximum degree in the graph.
Guaranteed real-time communication in packet-switched networks with FCFS queuing
Authors: Xing Fan, Magnus Jonsson, Jan Jonsson
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

In this paper, we propose a feasibility analysis of periodic hard real-time traffic in packet-switched networks using first come first served (FCFS) queuing but no traffic shapers. Our work constitutes a framework that can be adopted for real-time analysis of switched low-cost networks like Ethernet without modification of the standard network components. Our analysis is based on a flexible network and traffic model, e.g., variable-sized frames, arbitrary deadlines and multiple switches. The correctness of our real-time analysis and the tightness of it for network components in single-switch networks are given by theoretical proofs. The performance of the end-to-end real-time analysis is evaluated by simulations. Moreover, our conceptual and experimental comparison studies between our analysis and the commonly used Network Calculus (NC) shows that our analysis can achieve better performance than NC in many cases.
SolidWorks 2007 Tutorial
Authors: David C. Planchard, Marie P. Planchard
Venue:  (2007)

SolidWorks 2007 Tutorial is written to assist students, designers, engineers and professionals. The book provides a introduction to the user interface, menus, toolbars, concepts and modeling techniques of SolidWorks to create parts, assemblies and drawings. Follow the step-by-step instructions and develop multiple assemblies that combine over 80 extruded machined parts and components. Formulate the skills to create, modify and edit sketches and solid features. Learn the techniques to reuse features, parts and assemblies through symmetry, patterns, copied components, design tables and configurations. Review 2 hours of flash movie files that follow the steps in the book. Desired outcomes and usage competencies are listed for each project. Know your objective up front. Follow the steps in Project 1 through Project 4 to achieve your design goals. Work between multiple documents, features, commands and custom properties that represent how engineers and designers utilize SolidWorks in industry. Table of Contents Introduction 1. Linkage Assembly 2. Front Support Assembly 3. Fundamentals of Drawing 4. Pneumatic Test Module Assembly Appendix Index
Computation of the integrated flow of particles between polygons
Authors: Annie Bouvier, Kiên Kiêu, Katarzyna Adamczyk, Hervé Monod
Venue: Environmental Modelling Software (2009)

To quantify the flow of particles over a heterogeneous area, some models require the integration of a pointwise dispersal function over source and target polygons. This calculation is a non-trivial task and may require a great deal of computing time. In this paper, an efficient and accurate algorithm is presented to integrate general individual dispersal functions between pairs of convex or non-convex polygons. Geometric calculations are performed using standard tools from computational geometry. Numerical integration is then performed either by a grid method or by an adaptive cubature method. The procedure is illustrated with a case study. It is shown that the cubature method is much more efficient than the grid method and that its error estimates are accurate. The algorithm is implemented in a C++ program, Califlopp.
Heterogeneous composition of models of computation
Authors: Antoon Goderis, Christopher Brooks, Ilkay Altintas, Edward A. Lee, Carole Goble
Venue: Future Generation Computer Systems (2009)

A model of computation (MoC) is a formal abstraction of execution in a computer. There is a need for composing diverse MoCs in e-science. Kepler, which is based on Ptolemy II, is a scientific workflow environment that allows for MoC composition. This paper explains how MoCs are combined in Kepler and Ptolemy II and analyzes which combinations of MoCs are currently possible and useful. It demonstrates the approach by combining MoCs involving dataflow and finite state machines. The resulting classification should be relevant to other workflow environments wishing to combine multiple MoCs (available at http://ptolemy.org/heterogeneousMoCs).
Lifelong Learner Modeling for Lifelong Personalized Pervasive Learning
Authors: Judy Kay
Venue: IEEE Transactions on Learning Technologies (2008)

Pervasive and ubiquitous computing have the potential to make huge changes in the ways that we will learn, throughout our lives. This paper presents a vision for the lifelong user model as a first class citizen, existing independently of any single application and controlled by the learner. The paper argues that this is a critical foundation for a vision of personalised lifelong learning as well as a form of augmented cognition that enables learners to supplement their own knowledge with readily accessible digital information based on documents that they have accessed or used. The paper presents work that provides foundations for this vision for a lifelong user model. First, it outlines technical issues and research into approaches for addressing them. Then it presents work on the interface between the learner and the lifelong user model because the human issues of control and privacy are so central. The final discussion and conclusions draw upon these to define a roadmap for future research in a selection of the key areas that will underpin this vision of the lifelong user model.
INDISS: interoperable discovery system for networked services
Authors: Yérom-David Bromberg, Valérie Issarny
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

The emergence of handheld devices associated with wireless technologies has introduced new challenges for middleware. First, mobility is becoming a key characteristic; mobile devices may move around different areas and have to interact with different types of networks and services, and may be exposed to new communication paradigms. Second, the increasing number and diversity of devices, as in particular witnessed in the home environment, lead to the advertisement of supported services according to different service discovery protocols as they come from various manufacturers. Thus, if networked services are advertised with protocols different than those supported by client devices, the latter are unable to discover their environment and are consequently isolated. This paper presents a system based on event-based parsing techniques to provide full service discovery interoperability to any existing middleware. Our system is transparent to applications, which are not aware of the existence of our interoperable system that adapts itself to both its environment across time and its host to offer interoperability anytime anywhere. A prototype implementation of our system is further presented, enabling us to demonstrate that our approach is both lightweight in terms of resource usage and efficient in terms of response time.