ppxscal/embedding_network huggingface dataset:
Constrained optimization for validation-guided conditional random field learning
Authors: Minmin Chen, Yixin Chen, Michael R. Brent, Aaron E. Tenney
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Conditional random fields(CRFs) are a class of undirected graphical models which have been widely used for classifying and labeling sequence data. The training of CRFs is typically formulated as an unconstrained optimization problem that maximizes the conditional likelihood. However, maximum likelihood training is prone to overfitting. To address this issue, we propose a novel constrained nonlinear optimization formulation in which the prediction accuracy of cross-validation sets are included as constraints. Instead of requiring multiple passes of training, the constrained formulation allows the cross-validation be handled in one pass of constrained optimization. The new formulation is discontinuous, and classical Lagrangian based constraint handling methods are not applicable. A new constrained optimization algorithm based on the recently proposed extended saddle point theory is developed to learn the constrained CRF model. Experimental results on gene and stock-price prediction tasks show that the constrained formulation is able to significantly improve the generalization ability of CRF training.
An OWL Ontology of Fundamental Legal Concepts
Authors: Rossella Rubino, Antonino Rotolo, Giovanni Sartor
Venue: Proceeding of the 2006 conference on Legal Knowledge and Information Systems: JURIX 2006: The Nineteenth Annual Conference (2006)

In this paper we present an OWL ontology of fundamental legal concepts developed within the ESTRELLA European project. The ontology includes the basic normative components of legal knowledge: deontic modalities, obligative rights, permissive rights, liberty rights, liability rights, different kinds of legal powers, potestative rights (rights to produce legal results) and sources of law. Besides the taxonomy the ontology comprises also the semantic relations between the concepts. We hope that it may be useful for semantic access to digital legal information and for the representation of legal knowledge.
Integrated routing and MAC scheduling for single-channel wireless mesh networks
Authors: Zhibin Wu, Dipankar Raychaudhuri
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper presents an integrated routing and MAC scheduling protocol (IRMA) for multihop wireless mesh networks. The IRMA approach is motivated by the fact that the overall performance achieved by conventional layered approaches (802.11 MAC combined with independent ad hoc routing protocols) is significantly lower than the underlying network capacity. We propose to integrate the routing and MAC into a single protocol layer and use joint optimization techniques to establish end-to-end path and TDMA schedules for flows across the network. This approach achieves non-conflicting allocation of channel resources based on global or local traffic flow specifications and the network graph. The proposed method not only establishes interference-free MAC link schedules, but also helps to find optimal routes which can route around congested areas of the network. Two specific IRMA algorithms are proposed and evaluated in this paper. The first method solves min-hop routing, then optimizes link scheduling based on routing results and real-time flow demands. The second approach attempts to optimize routing and scheduling decisions simultaneously, using available MAC bandwidth information to route around congested areas. Both centralized and distributed algorithms based on these methods are proposed and evaluated with detailed simulations. Results show significant 2–3x improvements in network throughput when compared with baseline 802.11-based mesh networks using independent routing protocols.
Stiffness discrimination with visual and proprioceptive cues
Authors: Netta Gurari, Katherine J. Kuchenbecker, Allison M. Okamura
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

This study compares the Weber fraction for human perception of stiffness among three conditions: vision, proprioceptive motion feedback, and their combination. To make comparisons between these feedback conditions, a novel haptic device was designed that senses the spring behavior through encoder and force measurements, and implements a controller to render linear virtual springs so that the stimuli displayed haptically could be compared with their visual counterparts. The custom-designed, torque-controlled haptic interface non-invasively controls the availability of proprioceptive motion feedback in unimpaired individuals using a virtual environment. When proprioception is available, the user feels an MCP joint rotation that is proportional to his or her finger force. When proprioception is not available, the actual finger is not allowed to move, but a virtual finger displayed graphically moves in proportion to the user's applied force. Visual feedback is provided and removed by turning on and off this graphical display. Weber fractions were generated from an experiment in which users examined pairs of springs and attempted to identify the spring with higher stiffness. To account for slight trial-to-trial variations in the relationship between force and position in the proprioceptive feedback conditions, our analysis uses measurements of the actual rendered stiffness, rather than the commanded stiffness. Results for 10 users give average Weber fractions of 0.056 for vision, 0.036 for proprioception, and 0.039 for their combination, indicating that proprioception is important for stiffness perception for this experimental setup. The long-term goal of this research is to motivate and develop methods for proprioception feedback to wearers of dexterous upper-limb prostheses.
Interference in wireless multihop networks: A model and its experimental evaluation
Authors: Georgios Parissidis, Merkourios Karaliopoulos, Martin May, Thrasyvoulos Spyropoulos, Bernhard Plattner
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Interference is an inherent property of wireless multihop networks. Adding interference-awareness to their control functions can significantly enhance the overall network performance. In this paper we present an analytical model for the probability that a transmission destined to an arbitrary network node is successful in the presence of interference from other nodes in the network. We introduce the concept of interference areas and interference zones to express this probability as a function of the network density, node transmission probability, radio propagation environment, and network card reception sensitivity. Our derivation includes a simpleMAC model, which captures the carrier sense function of many MAC protocols. Contrary to measurementbased models, our derivation only requires information that is locally available to the nodes, avoiding all measurement-related pitfalls. The validation of our model against experiments in a real testbed, set up for this purpose in our indoor office environment, shows good match of the experimental results with the analytical predictions. Interestingly our model predictions follow closely those of more elaborate state-of-the-art analytical models. Finally, to demonstrate the real utility of our model, we have implemented on our testbed a routing metric that explicitly takes interference into account via our derivation. The throughputs of the resulting routes compare favorably with those achieved by a well-known probe-based routing metric.
New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
Authors: Vladimir Britanak
Venue: Signal Processing (2009)

New universal rotation-based fast computational structures identical both for the discrete cosine/sine transform of type IV (DCT-IV/DST-IV) and the forward/backward modified discrete cosine/sine transform (MDCT/MDST) computation are described. They are the result of a systematic construction of a fast algorithm for an efficient implementation of the time domain aliasing cancellation (TDAC) analysis/synthesis MDCT/MDST filter banks employed in various audio compression schemes. New fast algorithms provide novelty computational structures based exclusively on the computation of Givens-Jacobi rotations, and thus, the need of any discrete sinusoidal unitary transform such as the discrete Fourier transform (DFT), DCT-IV/DST-IV or discrete cosine/sine transforms of type II (DCT-II/DST-II) of reduced size is completely eliminated, so simplifying the computational structure of the algorithms. The rotators and summators are used only as the basic computational modules (in a hardware implementation they are simple hardware blocks). The simple and regular Givens-Jacobi rotation-based fast computational structures valid for any N divisible by 4 (N being the length of data sequence) define new sparse matrix factorizations of the DCT-IV and MDCT matrices and in particular, generate an efficient implementation of the MDCT in MP3 audio coding standard. For a given N=2^n they can be easily reconfigurable for a specific audio coding scheme. Finally, since Givens-Jacobi rotation can be factored into a product of Gauss elementary matrices being unit lower and unit upper triangular matrices, the new fast rotation-based computational structures are suitable for an integer approximation of the DCT-IV/DST-IV (integer DCT-IV/DST-IV) and MDCT/MDST (integer MDCT/MDST) which are currently modern transform technologies for lossless audio coding.
Composition semantics for executable and evolvable behavioral modeling in MDA
Authors: Ashley McNeile, Ella Roubtsova
Venue: Proceedings of the 1st Workshop on Behaviour Modelling in Model-Driven Architecture (2009)

The vision of MDA is to decouple the way that application systems are defined from the specification of their deployment platform. Achieving this vision requires that Platform Independent models are rich enough to capture the behavior of the application, and to support reasoning and execution of functional behavior. We focus on state transition modeling as being the best able to support MDA and appraise the two types of state machine (Behavior State Machines and Protocol State Machines) defined in UML. We conclude that, for different reasons, neither has semantics that are well placed to serve as a basis for PIM level behavior modeling. We propose that state transition modeling can be both simplified and strengthened by providing semantics that support process algebraic composition. We claim a number of important advantages for this. Firstly, it provides a common language for defining a range of behavioral abstractions, including software components, behavioral contracts and cross-cutting aspects. Secondly that it better supports analysis of models, by exploiting the formal analysis techniques of process algebra. Thirdly, the semantics enable model execution and testing at the platform independent level across a wider domain than is possible with current UML formalisms.
Open paper: caT: adapting and updating the trellis hypertext model
Authors: Jin-Cheon Na, Richard Furuta
Venue: The New Review of Hypermedia and Multimedia (2006)

The Trellis project has investigated the structure and semantics of human-computer interaction in the context of hypertext systems. The Trellis model is defined formally using coloured timed Petri nets as the structure of a hyperprogram, and this gives the model an elegant structure that can be both programmed and analysed. In this paper, we review and reexamine the Trellis hypertext model and its implementations to identify ways in which the model can be applied in modern computing environments and to determine improvements that will enhance the usability of the implementations. We discuss issues with Trellis concerning the graphical complexity of specifications, the characteristics of mobile and Web-based environments, and the specifics of its prototypes' user interfaces and implementation platforms. Based on our analyses, we have enhanced the model and extended the earlier systems to produce a new prototype called caT (for context-aware Trellis) which provides a framework for authoring, browsing, and analysis of reasonably complex, dynamic hypertexts. We describe how caT addresses the issues identified in Trellis. We also describe the results of our small usability study of the caT system and discuss matters that we continue to investigate.
A study on e-commerce security in Jordan
Authors: Ahmad Khasawneh, Iyad Al Azzam, Mohammad Bsoul
Venue: International Journal of Electronic Finance (2009)

The internet and all other kinds of networks have changed our way of life in general and the way to do business in particular and, as a result, many companies nowadays are conducting and transferring their businesses online. However, some of them are not successful. Until now, the majority of companies and customers have not been certain that doing business online is secure and protects them from any illegal activities, since there is no physical interaction (face-to-face) between customers and companies and every business will be cautious about payment methods, the quality and quantity of products or services and the delivery system, among many others. This paper attempts to evaluate whether security issues are the major obstacles to the growth of e-commerce in Jordan. A survey conducted for the study reveals that security issues are major barriers to internet banking and e-commerce activities among consumers.
BlackBerry Bold 9000 Made Simple: For the Bold 9000, 9010, 9020, 9030, and all 90xx Series BlackBerry Smartphones.
Authors: Martin Trautschold
Venue:  (2009)

This guide book is unique in that it helps both Windows and Apple Mac users with all aspects of the BlackBerry Bold 90xx. Some of the highlights include: Dozens of hidden or little-known time-saving tips and tricks. How to configure and use Wi-Fi and GPS Synchronizing your BlackBerry with your Windows or Mac computer. How to squeeze every ounce of power from the Address Book, Calendar, Tasks and MemoPad. How to become Master of Your BlackBerry Email How to use Google Sync for true Wireless Sync without an Enterprise Server Support for both BlackBerry Internet Service and Corporate BlackBerry Enterprise Server users. Tips and tricks to unlock the rich Media Features of the BlackBerry Bold. How turn your Bold into something that could replace a video and audio iPod How to use your Bold for Mapping (including Google Maps.) Learn how to go Online and download Facebook and Myspace for your BlackBerry
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
Authors: Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

The autocorrelation function and related correlation length are statistical quantities that capture the ruggedness of the fitness landscape: a measure that is directly related to the hardness of a problem for certain heuristic search algorithms. Typically, these quantities are estimated empirically by sampling along a random walk. In this paper, we show that a polynomial-time Walsh decomposition of the k-satisfiability evaluation function allows us to compute the exact autocorrelation function and correlation length for any given k-satisfiability instance. We also use the decomposition to compute a theoretical expectation for the autocorrelation function and correlation length over the ensemble of instances generated uniformly at random. We find that this expectation is invariant to the constrainedness of the problem as measured by the ratio of clauses to variables. However, we show that filtered problems, which are typically used in local search studies, have a bias that causes a significant deviation from the expected correlation structure of unfiltered, uniformly generated problems.
Prioritized multihypothesis tracking by a robot with limited sensing
Authors: Paul E. Rybski, Manuela M. Veloso
Venue: EURASIP Journal on Advances in Signal Processing (2009)

To act intelligently in dynamic environments, mobile robots must estimate object positions using information obtained from a variety of sources. We formally describe the problem of estimating the state of objects where a robot can only task its sensors to view one object at a time. We contribute an object tracking method that generates and maintains multiple hypotheses consisting of probabilistic state estimates that are generated by the individual information sources. These different hypotheses can be generated by the robot's own prediction model and by communicating robot team members. The multiple hypotheses are often spatially disjoint and cannot simultaneously be verified by the robot's limited sensors. Instead, the robot must decide towards which hypothesis its sensors should be tasked by evaluating each hypothesis on its likelihood of containing the object. Our contributed algorithm prioritizes the different hypotheses, according to rankings set by the expected uncertainty in the object's motion model, as well as the uncertainties in the sources of information used to track their positions. We describe the algorithm in detail and show extensive empirical results in simulation as well as experiments on actual robots that demonstrate the effectiveness of our approach.
State feedback under changeable operating conditions
Authors: Bohumil Sulc
Venue: Proceedings of the 4th WSEAS/IASME international conference on Dynamical systems and control (2008)

A state variable feedback technique is usually used when controlled system dynamics is to be changed in a desired way. The results are very good provided that the linear state space representation used in the design is sufficiently valid in the whole operating range. In the paper, we present a case study of a tank cascade with changeable static and dynamic properties. When these changes are so significant that superior PI or PID controllers require resetting, it is advantageous to adapt the proportional state variable feedback. We assessed the impact of the feedback gain changes resulting from changes in the linear state model parameters used in the design of the gains.
Wide-band beamformer with integrated antennas
Authors: Amirhossein Fereidountabar
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2009)

A part of the development of a new international radio-telescope SKA (Square Kilometer Array), three phased-array prototypes with increasing complexity have been developed. The final SKA telescope will consist of more than one million receiving antenna elements and will operate in the frequency range of 200 to 2000 MHz. One of the challenges of the next generation radio telescopes for astronomy is its capacity to cope with the increasing problem of Radio Frequency Interference (RFI). The application of phased-array beamforming techniques opens the possiblity to spatially null RFI in the digital domain prior to correlation. This paper presents results from the third phased-array experimental demonstrator that is being developed at NFRA, the THousand Element Array (THEA), on the RF Beamformer boards with integrated antenna array.
Image compression and decompression using adaptive interpolation
Authors: Sunil Bhooshan, Shipra Sharma
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

A simple and fast lossy compression and decompression algorithm for digital images is proposed. The method offers varying compression ratios (depending on dimensions of the image) and the acquired decompressed image is close to the original one. A selectable tradeoff between storage size and image quality is allowed, making it possible to adjust degree of compression. Compared to JPEG, it provides us better compression ratio. The suggested method does not restrict itself to any particular type of image.
A Commands Guide For Solidworks 2008, 1st edition
Authors: David Planchard, Marie Planchard
Venue:  (2007)

Learn to effectively create, modify, and edit sketches and solid features using the latest release of one of the most popular software programs in the industry, SolidWorks 2008. A Commands Guide for SolidWorks 2008 offers readers a comprehensive reference guide that begins with an overview of the software's concepts and terminology. Subsequent chapters address System and Document properties, FeatureManagers, PropertyManagers, ConfigurationManagers, and RenderManagers as well as 2D and 3D sketch tools, sketch entities, and more. This thorough coverage provides readers with a solid understanding of the techniques for reusing features, parts, and assemblies through symmetry, patterns, copied components, design tables, and configurations. The perfect resource for users with beginner to intermediate-level experience with SolidWorks, this book illustrates clearly and carefully how multiple design situations and systematic steps combine to produce successful designs.
Defining relevant distances between server workloads
Authors: Ilya Gluhovsky, Lodewijk Bonebakker
Venue: Performance Evaluation (2009)

Computer system design studies traditionally involve only small collections of benchmarks. Detailed benchmark analysis is extremely time consuming and requires a large amount of human and machine resources. Therefore, it is essential that the benchmark collection be representative of the customer workloads for which an architecture is developed. In recent work, interworkload distances have been proposed as a way of characterizing workload similarity. These distances are based on measurable/computable program characteristics, such as instruction mix or dependence distance. In the literature, these characteristics enter the distances symmetrically. We observe that the program behavior impact of different characteristics varies significantly. We propose a method of estimating the program behavior impact via a regression model. Its components then enter the distance definition directly, thus emphasizing high-impact characteristics. We also propose a data collection methodology that can be deployed at a customer site without requiring code instrumentation and/or a detailed simulation setup. We build a dataset consisting of 84 program characteristics for each of the 106 workloads and apply the proposed distance methodology to it.