ppxscal/embedding_network huggingface dataset:
Features: the more the better
Authors: Domingo Mery, Alvaro Soto
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

In pattern recognition problems, it is usually recommended to extract a low number of features in order to avoid the computational cost. However, using today's computer capabilities we are able to extract and process more features than before. In this way, in an off-line training process, it is possible to extract a very large number of features with the goal of finding relevant features for the classification task. Afterwards, in an on-line testing process, we can extract only the relevant features to classify the samples. In this paper, we use this idea to present a highly general pattern recognition methodology applied to image analysis. We combine feature extraction and feature selection techniques with highly simple classifiers to achieve high classification performances. The key idea of the proposed method is to select during training time, from a large universe of features (in some cases more than 1500 features), only those features that are relevant for the separation of the classes. We tested our methodology on six different recognition problems (with 2, 3, 6, 10 and 40 classes) yielding classification rates exceding 85% in accuracy in every case using no more than 8 features. The selected features are so robust that well known and simple classifiers are able to separate the classes.
On parameterized complexity of the Multi-MCS problem
Authors: Wenbin Chen, Matthew C. Schmidt, Nagiza F. Samatova
Venue: Theoretical Computer Science (2009)

We introduce the maximum common subgraph problem for multiple graphs (Multi-MCS) inspired by various biological applications such as multiple alignments of gene sequences, protein structures, metabolic pathways, or protein-protein interaction networks. Multi-MCS is a generalization of the two-graph Maximum Common Subgraph problem (MCS). On the basis of the framework of parameterized complexity theory, we derive the parameterized complexity of Multi-MCS for various parameters for different classes of graphs. For example, for directed graphs with labeled vertices, we prove that the parameterized m-Multi-MCS problem is W[2]-hard, while the parameterized k-Multi-MCS problem is W[t]-hard (@?t>=1), where m and k are the size of the maximum common subgraph and the number of multiple graphs, respectively. We show similar results for other parameterized versions of the Multi-MCS problem for directed graphs with vertex labels and undirected graphs with vertex and edge labels by giving linear FPT reductions of the problems from parameterized versions of the longest common subsequence problem. Likewise, for unlabeled undirected graphs, we show that a parameterized version of the Multi-MCS problem with a fixed number of input graphs is W[1]-complete by showing a linear FPT reduction to and from a parameterized version of the maximum clique problem.
Enforcing security for desktop clients using authority aspects
Authors: Brett Cannon, Eric Wohlstadter
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Desktop client applications interact with both local and remote resources. This is both a benefit in terms of the rich features desktop clients can provide, but also a security risk. Due to their high connectivity, desktop clients can leave a user's machine vulnerable to viruses, malicious plug-ins, and scripts. Aspect-Oriented Software Development can be used to address security concerns in software in a modular fashion. However, most existing research focuses on the protection of server-side resources. In this paper we introduce an aspect-oriented mechanism, Authority Aspects, to enforce the Principle of Least Privilege on desktop clients. This helps to ensure that legitimate resource access is allowed and illegitimate access is blocked. We present a case study applying our approach on two desktop applications: an RSS feed aggregator and a Web browser.
Micromotor of Less Than 1 mm^3 Volume for In Vivo Medical Procedures
Authors: Brett Watson, James Friend, Leslie Yeo
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

The body's stress response to surgery has been cited as a primary cause of post-operative morbidity and has prompted growth in minimally invasive surgical techniques. The future of such techniques lies in the use of in vivo procedures, but is currently limited by the availability of motors with a volume of less than 1 mm3.In response to this we present a piezoelectric ultrasonic resonant micromotor with a volume of approximately 0.75 mm3. The motor has a novel helically cut stator that couples axial and torsional resonant frequencies, excited by a lead zirconate titanate element 0.03 mm3 in volume. The motor performance reaches a start-up torque of 47 nNm and no load angular velocity of 830 rad/s. This gives the motor a power density of 18.4 kW/m3. This performance is on the order necessary to propel a swimming microbot in small human arteries.
Improving Performance of Conformant Planners: Static Analysis of Declarative Planning Domain Specifications
Authors: Dang-Vien Tran, Hoang-Khoi Nguyen, Enrico Pontelli, Tran Cao Son
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

The paper presents novel techniques to process planning problem specifications, expressed in a declarative description language, which enables the description of planning problems with incomplete knowledge. The outcome is improved performance and scalability of conformant planners. The paper proposes two transformations of a planning problem specification, aimed at reducing the size of the initial belief state and the number of actions to be dealt with. The two transformations have been implemented in a static analyzer and in a companion heuristic search conformant planner (CpA+). The performance of the resulting system is compared with other state-of-the-art conformant planners.
On Avoiding ZVP-Attacks Using Isogeny Volcanoes
Authors: J. Miret, D. Sadornil, J. Tena, R. Tomàs, M. Valls
Venue: Information Security Applications: 9th International Workshop, WISA 2008, Jeju Island, Korea, September 23-25, 2008, Revised Selected Papers (2009)

The usage of elliptic curve cryptography in smart cards has been shown to be efficient although, when considering curves, one should take care about their vulnerability against the Zero-Value Point Attacks (ZVP). In this paper, we present a new procedure to find elliptic curves which are resistant against these attacks. This algorithm finds, in an efficient way, a secure curve by means of volcanoes of isogenies. Moreover, we can deal with one more security condition than Akishita-Takagi method with our search.
Realization of E-University for distance learning
Authors: Hazem M. El-Bakry, Nikos Mastorakis
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

In previous work [27], the authors proposed an E-University but they did not take into account some essential parts. In this paper, the system presented in [27] is modified and developed. New critical important items such as security in E-Learning, learning management, business continuity management and science park are added to the proposed university. According to the great development of IT, the current Web-based learning systems need to be as effective as human tutors. Recently, intelligent agents became one of the most interesting subjects of modern information technology. Agent-based technology has been taken as an important approach for developing advanced E-Learning systems. This paper presents architecture for implementing a multi-agent system within the context of a learning environment. The roles of intelligent agents within an E-Learning system, called E-University, are presented. The agents perform specific tasks on the behalf of students, professors, administrators, and other members of the university. Also a group of intelligent agents for learning activities such as user interface agents, task agents, knowledge agents and mobile agents is developed. Using the multi-agent technology in E-Learning system, gives user interaction facility to both users and designers, and adds ability to exchange information between different objects in a flexible way.
Office 2008 for the Mac on Demand, 1 edition
Authors: Steve Johnson, Perspection Inc.
Venue:  (2008)

Office 2008 for the Mac on DemandSteve Johnson, Perspection Inc.What you need, when you need it!Need answers quickly? Office 2008 for the Mac on Demand provides those answers in a visual step-by-step format. We will show you exactly what to do through lots of full color illustrations and easy-to-follow instructions. You will learn how to use all the applications in Office 2008 including Word, Excel, PowerPoint, Entourage, Project Gallery, and Messenger.Inside the Book Office: Organize information and add impact with clip art, SmartArt diagrams, tables, and charts Word: Create great-looking documents, publications, and notebooks using themes, styles, and templates Excel: Use organizing, processing, and presenting tools to create data, lists, and charts PowerPoint: Create powerful presentations faster using ready-made design templates and themes Entourage: Use tools for creating and managing your e-mail, calendar, contacts, and tasks Project Center: Gather and manage important Office and non-Office project documents in a convenient centralized placeOn the Web Online Workshops Keyboard shortcuts Transitional tools Additional chapters www.perspection.com
Note: Fibonacci numbers and Lucas numbers in graphs
Authors: Mariusz Startek, Andrzej Włoch, Iwona Włoch
Venue: Discrete Applied Mathematics (2009)

A subset S@?V(G) is independent if no two vertices of S are adjacent in G. In this paper we study the number of independent sets in graphs with two elementary cycles. In particular we determine the smallest number and the largest number of these sets among n-vertex graphs with two elementary cycles. The extremal values of the number of independent sets are described using Fibonacci numbers and Lucas numbers.
A new approach for function approximation in boiler combustion optimization based on modified structural AOSVR
Authors: Fengqi Si, Carlos E. Romero, Zheng Yao, Zhigao Xu, Robert L. Morey, Barry N. Liebowitz
Venue: Expert Systems with Applications: An International Journal (2009)

In the scheme of boiler combustion optimization, a group of optimal controller settings is found to provide recommendations to balance desired thermal efficiency and lowest emissions limit. Characteristic functions between particular objectives and controlling variables can be approximated based on data sets obtained from field tests. These relationships can change with variations in coal quality, slag/soot deposits and the condition of plant equipment, which can not be sampled on-line. Thus, approximation relationships based on test conditions could have little applicability for on-line optimization of the combustion process. In this paper, a new approach is proposed to adaptively perform function approximation based on a modified accurate on-line support vector regression method. Two modified criteria are proposed for selection of the unwanted trained sample to be removed. A structural matrix is used to process and save the model parameters and training data sets, which can be adaptively regulated by the on-line learning method. The proposed method is illustrated with an example and is also applied to real boiler data successfully. The results reveal their validity in the prediction of NO"x emissions and function approximation, which can correctly be adapted to actual variable operating conditions in the boiler.
Clustering Uncertain Data Using Voronoi Diagrams
Authors: Ben Kao, Sau Dan Lee, David W. Cheung, Wai-Shing Ho, K. F. Chan
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We study the problem of clustering uncertain objects whose locations are described by probability density functions (pdf). We show that the UK-means algorithm, which generalises the k-means algorithm to handle uncertain objects, is very inefficient. The inefficiency comes from the fact that UK-means computes expected distances (ED) between objects and cluster representatives. For arbitrary pdf's, expected distances are computed by numerical integrations, which are costly operations. We propose pruning techniques that are based on Voronoi diagrams to reduce the number of expected distance calculation. These techniques are analytically proven to be more effective than the basic bounding-box-based technique previous known in the literature. We conduct experiments to evaluate the effectiveness of our pruning techniques and to show that our techniques significantly outperform previous methods.
Binding privacy rules to location on the web
Authors: Alissa Cooper, John Morris
Venue: Proceedings of the 2nd International Workshop on Location and the Web (2009)

As a tool for mitigating the potential privacy risks of gathering and transmitting location information on the Web, we suggest in this paper a model for conveying location information together with privacy rules to govern the use of that information. Binding privacy rules to the conveyance of location information is one useful tool to help developers build location-based systems and services that comport with the concept of fair information practices (FIPs)---a set of widely accepted principles that create a basis for privacy-protective systems. We offer as a model one fully developed set of standards for binding location data conveyed across IP networks to privacy rules.
INTELLECT: A System for Authoring, Distributing, and Presenting Multimedia Contents over the Internet
Authors: Soung C. Liew, Thomas Lau, Eddie Lau, Walter Fung
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

INTELLECT is a full-featured platform for multimedia content development and deployment for diverse application areas, ranging from education and training to electronic commerce and remote consultation. It contains both a client-server multimedia distribution system as well as an authoring tool. INTELLECT is compatible with Web technology, with added capabilities such as multimedia streaming, synchronized multimedia presentation, scalable reliability, and adaptability to network-traffic conditions.
Lotus Notes 7 Quick Reference Guide
Authors: Drew Sellers, Gordon Swift
Venue:  (2007)

This 4 page, laminated, full-color guide is a fantastic resource for anyone who uses Lotus Notes 7! In a concise user-friendly format, it provides step-by-step instructions, short cuts and tips on how to execute the basic commands of the software. The guide includes instructions on: Customize Lotus; Bookmark Bar; Working with Bookmarks; Viewing your Inbox; Creating and Sending Mail; Sending a Message to a Group; Deleting Mail Items; Letterhead and Signature Styles; Replying and Forwarding; Address Book; Attaching Files; Receiving Attachments; Viewing your Calendar; Creating Appointment or Events; Creating a Meeting; Setting Alarm Preferences; Creating a New To Do; Viewing To Do Status; Changing a Mail Message into a To Do; What is Replication; Creating a New Replica; The Replicator Page and Setting up Archiving.
A Common Lyapunov Function for a Class of Switched Descriptor Systems
Authors: Ze-quan Gu, He-ping Liu, Fu-cheng Liao
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

The existence of a common Lyapunov function for a class of linear switched descriptor systems was studied, where the system matrices were commute pairwise. We first presented work on two subsystems, a Lyapunov function was constructed and proved to be a common Lyapunov function of the system, and then we extended to the case of multi-subsytems, using the similar method. Finally, a sufficient condition for the existence of a common Lyapunov function for the linear switched descriptor system was presented, this assured the system asymptotically stable under arbitrary switching strategy.
Adaptive techniques for overcoming performance degradation due to aging in digital circuits
Authors: Sanjay V. Kumar, Chris H. Kim, Sachin S. Sapatnekar
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Negative Bias Temperature Instability (NBTI) in PMOS transistors has become a major reliability concern in present-day digital circuit design. Further, with the recent usage of Hf-based high-k dielectrics for gate leakage reduction, Positive Bias Temperature Instability (PBTI), the dual effect in NMOS transistors has also reached significant levels. Consequently, designers are required to build in substantial guard-bands into their designs, leading to large area and power overheads, in order to guarantee reliable operation over the lifetime of a chip. We propose a guard-banding technique based on adaptive body bias (ABB) and adaptive supply voltage (ASV), to recover the performance of an aged circuit, and compare its merits over previous approaches.
Block sorting: a characterization and some heuristics
Authors: Meena Mahajan, Raghavan Rama, S. Vijayakumar
Venue: Nordic Journal of Computing (2007)

Given a permutation π, the block sorting problem is to find a shortest series of block moves which, when applied in succession, sorts π. Here a block is a maximal substring of successive integers in order, and a block move is the displacement of a block to a location where it merges with another block, block sorting is an NP-hard optimization problem and has a factor 2 approximation algorithm. In this paper, we present a combinatorial characterization of optimal solutions of block sorting and use it to prove various computationally important properties of the problem. In particular, we identify certain block moves that are provably optimal. We also establish the equivalence of block sorting and a combinatorial puzzle. We consider several polynomial-time heuristics for block sorting that are inspired either by the above-mentioned combinatorial characterization, or by the approach that was based on the block merging problem, or both. Although these heuristics seem to be promising candidates for improving the approximation ratio (their approximation ratios are provably at most 2), we show that none of them leads to a better approximation ratio than 2.
Assignment Problems
Authors: Rainer Burkard, Mauro Dell'Amico, Silvano Martello
Venue:  (2009)

This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated webpage offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. Audience: Assignment Problems is a useful tool for researchers, practitioners, and graduate students. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its many variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. Contents: Preface; Chapter 1: Introduction; Chapter 2: Theoretical Foundations; Chapter 3: Bipartite Matching Algorithms; Chapter 4: Linear Sum Assignment Problem; Chapter 5: Further Results on the Linear Sum Assignment Problem; Chapter 6: Other Types of Linear Assignment Problems; Chapter 7: Quadratic Assignment Problems: Formulations and Bounds; Chapter 8: Quadratic Assignment Problems: Algorithms; Chapter 9: Other Types of Quadratic Assignment Problems; Chapter 10: Multi-index Assignment Problems; Bibliography; Author Index; Subject Index
Transition-aware decoupling-capacitor allocation in power noise reduction
Authors: Po-Yuan Chen, Che-Yu Liu, TingTing Hwang
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Dynamic power noises may not only degrade the circuit performance but also reduce the noise margin which may result in the functional errors in integrated circuit. Decoupling capacitor (decap) allocation is one of the most effective way in reducing serious dynamic power noises (hotspots). To allocate decap before placement, we observed that not only locations but also rising time of functional cells are required to accurately predict power noises. Compared to a previous work which only takes neighborhood relation into consideration, our method is more efficient in reducing hotspots. Furthermore, to reduce the hotspots after placement, instead of only using the empty space as proposed in the previous work, we move out cells in the area with serious power noise area (hot area). The obtained empty space can be used to accommodate decaps to further reduce the hotspots. The experimental result shows, compared to the previous work [1], our estimation function to allocate decap before placement is 23% better in reducing power noises. Moreover, compared to a method which fills decaps to all remaining empty space, our cell move algorithm can almost eliminate all the remaining hot grid nodes and hot cells. In summary, compared to the original circuits (without decap), about 60% of hotspots can be removed using our prediction function before placement, and most of the remaining hotspots are removed by our cell moving step after placement.
On Kalai&#x2019;s Conjectures Concerning Centrally Symmetric Polytopes
Authors: Raman Sanyal, Axel Werner, G&#x00fc;nter M. Ziegler
Venue: Discrete Computational Geometry (2009)

In 1989, Kalai stated three conjectures A, B, C of increasing strength concerning face numbers of centrally symmetric convex polytopes. The weakest conjecture, A, became known as the &#x201c;3d -conjecture.&#x201d; It is well known that the three conjectures hold in dimensions d&#x2264;3. We show that in dimension 4 only conjectures A and B are valid, while conjecture C fails. Furthermore, we show that both conjectures B and C fail in all dimensions d&#x2265;5.
GroupMind: supporting idea generation through a collaborative mind-mapping tool
Authors: Patrick C. Shih, David H. Nguyen, Sen H. Hirano, David F. Redmiles, Gillian R. Hayes
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Collaborative brainstorming can be a challenging but important part of creative group problem solving. Mind-mapping has the potential to enhance the brainstorming process but has its own challenges when used in a group. We introduce GroupMind, a collaborative mind-mapping tool that addresses these challenges and opens new opportunities for creative teamwork, including brainstorming. We present a semi-controlled evaluation of GroupMind and its impact on teamwork, problem solving and collaboration for brainstorming activities. GroupMind performs better than using a traditional whiteboard in both interaction group and nominal group settings for the task involving memory recall. The hierarchical mind-map structure also imposes important framing effects on group dynamics and idea organization during the brainstorming process. We also present design ideas to assist in the development of future tools to support creative problem solving in groups.