ppxscal/embedding_network huggingface dataset:
In search of personal information: narrative-based interfaces
Authors: Daniel Gonçalves, Joaquim A. Jorge
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Most computer users find organizing large amounts of personal information problematic. Often, hierarchies are the sole means to do it. However, users can remember a broader range of autobiographic contextual data about their personal items. Unfortunately, it can seldom be used to manage and retrieve them. Even when this is possible, it is often done by asking users to fill in values for arbitrary properties in dialog boxes or wizards. We propose that narrative-based interfaces can be a natural and effective way to help users recall relevant autobiographic data about their personal items and convey it to the computer. Using Quill, a narrative-based personal document retrieval interface, as a case-study, we show how such an interface can be designed. We demonstrate the approach's validity based on a set of user studies, discussing how the problems raised by the evaluation of such an interface were overcome.
Information Leakage via Electromagnetic Emanation and Effectiveness of Averaging Technique
Authors: Hidema Tanaka
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

It is well known that there is relationship between electromagnetic emanation and processing information in IT devices such as personal computers and smart cards. In this paper, we show how to estimate amount of information that is leaked as electromagnetic emanation and effectiveness of averaging technique. We assume the area between the IT device and the receiver is a communication channel, and we define the amount of information leakage via electromagnetic emanations by its channel capacity. And we also estimate the maximum amount of information which eavesdropper can get via electromagnetic emanation. By using these estimations, we derive the necessary amount of data for effective averaging technique.
A few chirps about twitter
Authors: Balachander Krishnamurthy, Phillipa Gill, Martin Arlitt
Venue: Proceedings of the first workshop on Online social networks (2008)

Web 2.0 has brought about several new applications that have enabled arbitrary subsets of users to communicate with each other on a social basis. Such communication increasingly happens not just on Facebook and MySpace but on several smaller network applications such as Twitter and Dodgeball. We present a detailed characterization of Twitter, an application that allows users to send short messages. We gathered three datasets (covering nearly 100,000 users) including constrained crawls of the Twitter network using two different methodologies, and a sampled collection from the publicly available timeline. We identify distinct classes of Twitter users and their behaviors, geographic growth patterns and current size of the network, and compare crawl results obtained under rate limiting constraints.
Applications Of Ramsey's Theorem To Decision Trees Complexity
Authors: S. Moran
Venue: Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984 (1984)

Combinatorial techniques for extending lower bounds results for decision trees to general types of queries are presented. We consider problems, which we call order invariant, that are defined by simple inequalities between inputs. A decision tree is called k-bounded if each query depends on at most k variables. We make no further assumptions on the type of queries. We prove that we can replace the queries of any k-bounded decision tree that solves an order invariant problem over a large enough input dornain with k-bounded queries whose outcome depends only on the relative order of the inputs. As a consequence, all existing lower bounds for comparison based algorithms are valid for general k-bounded decision trees, where k is a constant. We also prove an /spl Omega/(n log n) lower bound for the element uniqueness problem and several other problems for any k-bounded decision tree, such that k - )(n/sup c/) and c < 1/2. This lower bound is tight since that there exist n/sup 1/2/-bounded decision trees of complexity 0(n) that solve the element uniqueness problem. All the lower bounds mentioned above are shown to hold for nondeterministic and probabilistic decision trees as well.
Formal constraints on memory management for composite overloaded operations
Authors: Damian W. I. Rouson, Xiaofeng Xu
Venue: Scientific Programming (2006)

The memory management rules for abstract data type calculus presented by Rouson, Morris & Xu [15] are recast as formal statements in the Object Constraint Language (OCL) and applied to the design of a thermal energy equation solver. One set of constraints eliminates memory leaks observed in composite overloaded expressions with three current Fortran 95/2003 compilers. A second set of constraints ensures economical memory recycling. The constraints are preconditions, postconditions and invariants on overloaded operators and the objects they receive and return. It is demonstrated that systematic run-time assertion checking inspired by the formal constraints facilitated the pinpointing of an exceptionally hard-to-reproduce compiler bug. It is further demonstrated that the interplay between OCL's modeling capabilities and Fortran's programming capabilities led to a conceptual breakthrough that greatly improved the readability of our code by facilitating operator overloading. The advantages and disadvantages of our memory management rules are discussed in light of other published solutions [11,19]. Finally, it is demonstrated that the run-time assertion checking has a negligible impact on performance.
Enhanced resource management capabilities using standardized job management and data access interfaces within UNICORE Grids
Authors: M. Shahbaz Memon, A. Shiraz Memon, Morris Riedel, Bernd Schuller, Daniel Mallmann, Bastian Tweddell, Achim Streit, Sven van de Berghe, David Snelling, Vivian Li, Moreno Marzolla, Paolo Andreetto
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Many existing Grid technologies and resource management systems lack a standardized job submission interface in Grid environments or e-Infrastructures. Even if the same language for job description is used, often the interface for job submission is also different in each of these technologies. The evolvement of the standardized Job Submission and Description Language (JSDL) as well as the OGSA &#x2014; Basic Execution Services (OGSA-BES) pave the way to improve the interoperability of all these technologies enabling cross-Grid job submission and better resource management capabilities. In addition, the ByteIO standards provide useful mechanisms for data access that can be used in conjunction with these improved resource management capabilities. This paper describes the integration of these standards into the recently released UNICORE 6 Grid middleware that is based on open standards such as theWeb Services Resource Framework (WS-RF) and WS-Addressing (WS-A).
ULTRA GRIDSEC: Peer-to-Peer Computational Grid Middleware Security Using High Performance Symmetric Key Cryptography
Authors: Mostafa-Sami M. Mostafa, Safia H. Deif, Hisham Abd Elazeem, Ismail Kholidy
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

"ULTRA GRIDSEC" is a high-performance symmetric key cryptography scheme used to secure data passes inside Peer-to-Peer Computational Grid Middleware that we are developing now[1]. This schema is used to accelerate the performance of Triple data encryption standards(TDES) by about 439.7% and this percentage value is changed according to machine capabilities, also it enhances the security of encrypted TDES files. An analysis and comparison of this scheme and its performance is presented in this paper.
Programming by choice: urban youth learning programming with scratch
Authors: John H. Maloney, Kylie Peppler, Yasmin Kafai, Mitchel Resnick, Natalie Rusk
Venue: ACM SIGCSE Bulletin (2008)

This paper describes Scratch, a visual, block-based programming language designed to facilitate media manipulation for novice programmers. We report on the Scratch programming experiences of urban youth ages 8-18 at a Computer Clubhouse 'an after school center' over an 18-month period. Our analyses of 536 Scratch projects collected during this time documents the learning of key programming concepts even in the absence of instructional interventions or experienced mentors. We discuss the motivations of urban youth who choose to program in Scratch rather than using one of the many other software packages available to them and the implications for introducing programming at after school settings in underserved communities.
Personalized redirection and content adaptation for increased user control of communications
Authors: Yuping Yang, M. Howard Williams
Venue: Web Intelligence and Agent Systems (2007)

With the growing popularity of wireless devices, mobile users are wanting access to communications regardless of where they are and what devices they are using. Although most research has focussed on ubiquitous access to communication, people also want to have more control over when, where and how communications are delivered. This paper describes a personalized communication system that is able to intercept, filter, convert and direct communications to an appropriate device in an appropriate form depending on the user's context and preferences, thereby giving the user control over the delivery and presentation of information. This approach has been adapted to a pervasive system in the Daidalos project.
Integration of algebraic functions: a simple heuristic for finding the logarithmic part
Authors: Manuel Kauers
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

A new method is proposed for finding the logarithmic part of an integral over an algebraic function. The method uses Groebner bases and is easy to implement. It does not have the feature of finding a closed form of an integral whenever there is one. But it very often does, as we will show by a comparison with the built-in integrators of some computer algebra systems.
Combining learn-based and lexicon-based techniques for sentiment detection without using labeled examples
Authors: Songbo Tan, Yuefen Wang, Xueqi Cheng
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

In this work, we propose a novel scheme for sentiment classification (without labeled examples) which combines the strengths of both "learn-based" and "lexicon-based" approaches as follows: we first use a lexicon-based technique to label a portion of informative examples from given task (or domain); then learn a new supervised classifier based on these labeled ones; finally apply this classifier to the task. The experimental results indicate that proposed scheme could dramatically outperform "learn-based" and "lexicon-based" techniques.
A round- and computation-efficient three-party authenticated key exchange protocol
Authors: Tzung-Her Chen, Wei-Bin Lee, Hsing-Bai Chen
Venue: Journal of Systems and Software (2008)

In three-party authenticated key exchange protocols, each client shares a secret only with a trusted server with assists in generating a session key used for securely sending messages between two communication clients. Compared with two-party authenticated key exchange protocols where each pair of parties must share a secret with each other, a three-party protocol does not cause any key management problem for the parties. In the literature, mainly there exist three issues in three-party authenticated key exchange protocols are discussed that need to be further improved: (1) to reduce latency, communication steps in the protocol should be as parallel as possible; (2) as the existence of a security-sensitive table on the server side may cause the server to become compromised, the table should be removed; (3) resources required for computation should be as few as possible to avoid the protocol to become an efficiency bottleneck. In various applications over networks, a quick response is required especially by light-weight clients in the mobile e-commerce. In this paper, a round- and computation-efficient three-party authenticated key exchange protocol is proposed which fulfils all of the above mentioned requirements.
Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method
Authors: M. Alber, R. Reemtsen
Venue: Optimization Methods Software (2007)

The use of nonlinear functions describing biological effects has recently become a major goal in connection with intensity modulated radiotherapy planning models for cancer treatment. In this article, we present a new biological model for this purpose and discuss the solution of the related large-scale nonlinear optimization problems. The model includes equivalent uniform dose and partial volume constraints and employs tumor control probability as the objective. The resulting optimization problems are convex; there are nonconvex constrained optimization problems with several thousands of variables for which gradients of the involved functions are available, but the computation of Hessians is too costly. It is suggested to solve these problems using the barrier-penalty multiplier method by Polyak ([Polyak, R., 1992, Modified barrier functions (theory and methods). Mathematical Programming, 54, 177-222.], [Polyak, R., 2002, Nonlinear rescaling vs. smoothing technique in convex optimization. Mathematical Programming, 92, 197-235.]) and Ben-Tal et al. and Ben-Tal and Zibulevsky ([Ben-Tal, A., Yuzefokich, I. and Zibulevsky, M., 1992, Penalty/barrier multiplier methods for minimax and constrained smooth convex problems. Technical Report 9/92, Optimization Laboratory, Faculty of Industrial Engineering and Management, Technion, Haifa, Israel.], [Ben-Tal, A. and Zibulevsky, M., 1997, Penalty/barrier multiplier methods for convex programming problems. SIAM Journal of Optimization, 7, 347-366.]), where this algorithm is modified according to ideas which are motivated by the related Lagrangian barrier algorithm of Conn et al. ([Conn, A.R., Gould, N.I.M. and Taint, P., 1992, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Technical Report 92/07, Department of Maths, FUNDP, Namur, Belgium.], [Conn, A.R., Gould, N.I.M. and Taint, P.L., 1992, A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds. Mathematics of Computation, 66, 261-288.]). In particular, the subproblems in the algorithm are solved by a conjugate gradient method, as the spectrum of the Hessian of the Lagrangian at a solution of such problem indicates fast (local) convergence of the objective function values to a good approximate (locally) optimal value. Some characteristic numbers showing the average numerical performance of the algorithm are tabulated for various types of tumors and for a set of 127 clinical cases in total. Its capabilities and typical behavior also are illustrated explicitly by a computed therapy plan for a difficult clinical case of a larynx tumor.
To tag or not to tag -: harvesting adjacent metadata in large-scale tagging systems
Authors: Adriana Budura, Sebastian Michel, Philippe Cudré-Mauroux, Karl Aberer
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We present HAMLET, a suite of principles, scoring models and algorithms to automatically propagate metadata along edges in a document neighborhood. As a showcase scenario we consider tag prediction in community-based Web 2.0 tagging applications. Experiments using real-world data demonstrate the viability of our approach in large-scale environments where tags are scarce. To the best of our knowledge, HAMLET is the first system to promote an efficient and precise reuse of shared metadata in highly dynamic, large-scale Web 2.0 tagging systems.
CEDA Currents
Venue: IEEE Design Test (2008)

This newsletter covers news, research, and events related to the IEEE Council on Electronic Design Automation.
A multistage mean/variance approach for portfolio management in the Mexican market
Authors: Maria A. Osorio, Ana Ballinas, Erika Jiménez, Abraham Sánchez
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

This paper describes the use of Mean/Variance multistage portfolio management for building efficient frontiers. The maximization of the returns yields the maximum and the variance minimization the minimum points in the efficient frontier. The efficient frontier is the graph describing all the optimal options between these two points. The intermediate points are obtained minimizing the variance (risk measure) subject to different percentages of the maximum utility expected. According to the investor's characteristics, a point in the graph, containing a complete set of investment strategies can be chosen. The stochastic quadratic and linear models use a scenario tree to represent the multistage discretization of the random returns. The examples are applied to the Mexican bursaries market.
A spatio-temporal population model to support risk assessment and damage analysis for decision-making
Authors: Terhi Ahola, Kirsi Virrantaus, Jukka Matthias Krisp, Gary J. Hunter
Venue: International Journal of Geographical Information Science (2007)

The aim of this research is to develop and implement a simple spatio-temporal model of population location that might improve risk assessment and damage analysis for decision-making in both the Finnish Fire and Rescue Services and the Finnish Defence Forces. The motivation for the research is that present risk models do not take into account the temporal variation in population location during different times of the day. We use spatio-temporal modelling methods to model the population dynamics, and visualization techniques to represent the model outcomes. In addition, we apply the developed model to a damage-analysis application. The case study site is located in the centre of Helsinki. The model uses a basic population and workplace dataset maintained by the Helsinki Metropolitan Area Council. By means of this model, we intend to advance risk assessment, which considers the consequences of accidents. This model has the potential to help decision-makers evaluate their plans in several application areas-such as achieving better preparedness by having more reliable evacuation plans and resource allocation. In addition to the application-related technological research, a more generic framework about decision-making supported by spatio-temporal knowledge and visualization is presented.
On bounded lattices satisfying Elkan&#x2019;s law
Authors: Michiro Kondo, Wieslaw A. Dudek
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

In this short paper we shall prove that every bounded lattice L with the conditions: (c1) 1&#x2032; =&#x00a0; 0 and (EL): (a &#x00b7; b&#x2032;)&#x2032; =&#x00a0; b +&#x00a0; a&#x2032; &#x00b7; b&#x2032; for all a, b &#x2208; L is a Boolean algebra. This is a more general result than that of Renedo et&#x00a0;al. (Proceedings NAFIPS&#x2019;04, 2004), in which it is proved that every orthocomplemented lattice with (EL) is a Boolean algebra.
Design of dual threshold voltages asynchronous circuits
Authors: Behnam Ghavami, Hossein Pedram
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

This paper introduces a framework for the minimization of leakage power consumption of asynchronous circuits via using dual threshold voltages technique. The utilized circuit model is an extended Timed Petri-Net which captures the dynamic behavior of the circuit. We propose a heuristic method based on quantum genetic algorithm which finds the optimal high and low threshold voltage assignment. Experimental results are given for a number of 90 nm ISCAS benchmark circuits. From the experimental results, we show that the combination of asynchronous and multiple threshold voltage design techniques is an effective way to achieve low leakage power budget in high performance asynchronous circuits.
Merging nodes under sequential observability
Authors: Michael L. Case, Victor N. Kravets, Alan Mishchenko, Robert K. Brayton
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

This paper presents a new type of sequential technology independent synthesis. Building on the previous notions of combinational observability and sequential equivalence, sequential observability is introduced and discussed. By considering both the sequential nature of the design and observability simultaneously, better results can be obtained than with either algorithm alone. The experimental results show that this method can reduce the technology-independent gate count up to 10% more than the previously best known synthesis techniques.
Opportunistic programming: how rapid ideation and prototyping occur in practice
Authors: Joel Brandt, Philip J. Guo, Joel Lewenstein, Scott R. Klemmer
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

At times, programmers work opportunistically, emphasizing speed and ease of development over code robustness and maintainability. They do this to prototype, ideate, and discover; to understand as quickly as possible what the right solution is. Despite its importance, opportunistic programming remains poorly understood when compared with traditional software engineering. Through fieldwork and a laboratory study, we observed five characteristics of opportunistic programming: Programmers build software from scratch using high-level tools, often add new functionality via copy-and-paste, iterate more rapidly than in traditional development, consider code to be impermanent, and face unique debugging challenges because their applications often comprise many languages and tools composed without upfront design. Based on these characteristics, we discuss future research on tools for debugging, code foraging and reuse, and documentation that are specifically targeted at this style of development.
A Novel Location-Aided Routing Algorithm for MANETs
Authors: Kun Wang, Meng Wu, Lu Weifeng, Xia Pengrui, Subin Shen
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

The movement of nodes in MANETs results in a change in routes, requiring some mechanism for determining new routes. In this paper, a Distance-Based Location-Aided Routing (DBLAR) for MANETs had been proposed. By tracing the LI of destination nodes and the change of distance between nodes to adjust route discovery dynamically, the proposed routing algorithm can avoid flooding in the whole networks. Besides, Distance Update Threshold (DUT) is set up to reach the balance between real-time abil-ity and update overhead of location information (LI) of nodes. Meanwhile, the detection of relative dis-tance vector (RDV) can achieve the goal of adjusting forwarding condition. Simulation results reveal that DBLAR performs better than LAR in terms of packet successful delivery ratio, average end-to-end delay and routing-load, and the set of DUT and RDV has much effect on this algorithm.