ppxscal/embedding_network huggingface dataset:
Exploiting large scale web semantics to build end user applications
Authors: Enrico Motta
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

A large scale semantic web, already characterized by thousands of ontologies and millions of RDF documents, is now a reality and this rapidly growing resource is opening the way to a new generation of intelligent applications. In this talk I will show some work we have been doing on building end-user applications which exploit this unprecedented resource. In particular, I will show how large scale semantics can be used to try and enhance typical web-centric activities, such as web browsing, searching for information, and rating and reviewing consumer items. While most of this work is still at a rather early stage, it already provides evidence that the Semantic Web can be concretely used to bring new functionalities to the users. These positive results also show that it is possible to build intelligent and robust applications, while at the same time doing away with the traditional assumptions in knowledgebased systems, that the available domain knowledge has to be consistent, well-designed and high quality.
NLX Plus Flash Equals Quick Simulation-Driven Animations
Authors: J. Mailen Kootsey, Grant McAuley
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Recent additions to the Adobe Flash library of functions implement data transfers between Flash and Java or Javascript. Using these functions, we linked Flash graphics to the NumberLinX (NLX) architecture for rapid construction of interactive simulations in Web pages. Calculated variables in an NLX model drive attributes in a Flash graphic during a simulation to change coordinates, sizes, shapes, or colors. The result is a simulation driven animation suitable for learning, entertainment, or business. With the NLX Model Builder wizard and integration of NLX into Adobe Dreamweaver, building an interactive graphic animation in a Web page -- from model equation entry to visual layout -- can be accomplished without coding in Java, Javascript, or HTML.
Evaluating computer technology integration in a centralized school system
Authors: Nikleia Eteokleous
Venue: Computers Education (2008)

The study evaluated the current situation in Cyprus elementary classrooms regarding computer technology integration in an attempt to identify ways of expanding teachers' and students' experiences with computer technology. It examined how Cypriot elementary teachers use computers, and the factors that influence computer integration in their classroom practices. To address the study's research questions, an evaluative case study design was applied. It employed a mixed method approach through the usage of structured questionnaires and semi-structured, open-ended interviews as the major methods of data collection. Quantitative and qualitative data gathered from a sample of Cypriot teachers who where identified as high and low computer use ones. The results of the study revealed that computers are not extensively used in classrooms. When they are used in classrooms, it tends to be in a rather sporadic fashion, more as supporting tools or fancy chalkboards than as educational tools. Few teachers were found to use computers in any sort of progressive way. Three categories of factors (personal, professional and organizational) that influence teachers in applying computers in their classroom practices were identified. They shed light in explaining the level and kind of computer integration in Cyprus elementary schools. The outcomes confirm the findings of other studies conducted in different educational settings regarding computer usage as well as the factors that influence computer integration. Consequently, the study suggest ways of expanding teachers' and students' experiences with computer technology, poses questions for further research regarding the potential approaches to computer technology integration and the philosophy that underlies computer integration in schools.
A process framework for system and software development governance
Authors: Barry Boehm
Venue: Proceedings of the 1st international workshop on Software development governance (2008)

Effective system and software development governance involves clear definitions of a project's desired business objectives and associated roles, responsibilities, and authorities; concurrent determination of the system's objectives, constraints, priorities, and solutions with respect to business and technical feasibility; thorough definition of implementation plans; monitoring and control of project progress with respect to plans; and pro-active monitoring of the business and operational environment to adapt the plans to new challenges and opportunities. This talk will present a value-based process framework and life cycle process model called the Incremental Commitment Model (ICM) for achieving effective system and software development governance. Its underlying principles are (1) Commitment and accountability; (2) Success-critical stakeholder satisficing; (3) Incremental growth of system definition and stakeholder commitment; (4, 5) Concurrent, iterative system definition and development cycles (Cycles can be viewed as sequential concurrently-performed phases or spiral growth of system definition); and (6) Risk-based activity levels and anchor point commitment milestones. Its phases and activities are extensions of the Rational Unified Process phases and activities that include the use of business case analysis to justify resource commitments and to monitor progress with respect to business objectives. The talk will provide examples of its use in project governance, and extensions to portfolio and enterprise governance.
Sensitivity to scene motion for phases of head yaws
Authors: Jason Jerald, Tabitha Peck, Frank Steinicke, Mary Whitton
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

In order to better understand how scene motion is perceived in immersive virtual environments and to provide guidelines for designing more useable systems, we measured sensitivity to scene motion for different phases of quasi-sinusoidal head yaw motions. We measured and compared scene-velocity thresholds for nine subjects across three conditions: visible <u>W</u>ith head rotation (W) where the scene is presented during the center part of sinusoidal head yaws and the scene moves in the same direction the head is rotating, visible <u>A</u>gainst head rotation (A) where the scene is presented during the center part of sinusoidal head yaws and the scene moves in the opposite direction the head is rotating, and visible at the <u>E</u>dge of head rotation (E) where the scene is presented at the extreme of sinusoidal head yaws and the scene moves during the time that head direction changes. The W condition had a significantly higher threshold (decreased sensitivity) than both the E and A conditions. The median threshold for the W condition was 2.1 times the A condition and 1.5 times the E condition. We did not find a significant difference between the E and A conditions, although there was a trend for the A thresholds to be less than the E thresholds. An Equivalence Test showed the A and E thresholds to be statistically equivalent. Our results suggest the phase of user's head yaw should be taken into account when inserting additional scene motion into immersive virtual environments if one does not want users to perceive that motion. In particular, there is much more latitude for artificially and imperceptibly rotating a scene, as in Razzaque's redirecting walking technique, in the same direction of head yaw than against the direction of yaw. The implications for maximum end-to-end latency in a head-mounted display is that users are less likely to notice latency when beginning a head yaw (when the scene moves with the head) than when slowing down a head yaw (when the scene moves against the head) or when changing head direction (when the head is near still and scene motion due to latency is maximized).
Exponential weight algorithm in continuous time
Authors: Sylvain Sorin
Venue: Mathematical Programming: Series A and B (2008)

The exponential weight algorithm has been introduced in the framework of discrete time on-line problems. Given an observed process $$\{X_m\}_{m=1,2,\ldots}$$ the input at stage m&#x00a0;+&#x00a0;1 is an exponential function of the sum $$S_m = \sum_{\ell = 1}^m X_{\ell}$$. We define the analog algorithm for a continuous time process X t and prove similar properties in terms of external or internal consistency. We then deduce results for discrete time from their counterpart in continuous time. Finally we compare this approach to another continuous time approximation of a discrete time exponential algorithm based on the average sum S m /m.
Appreciating the Contribution of Broadband ICT With Rural and Remote Communities: Stepping Stones Toward an Alternative Paradigm
Authors: Ricardo Ramírez
Venue: The Information Society (2007)

This article challenges conventional policy development and evaluation approaches that emphasize the instrumental side of technology. There is a growing gap between conventional planning and evaluation approaches for rural broadband ICTs that seek to demonstrate a direct link between investments and results on the one hand, and on the other, with evidence that the contribution of ICTs to rural economic, social and cultural wellbeing is increasingly difficult to demonstrate beyond short-term measurable indicators. The article proposes an alternative paradigm based on sociotechnical systems, stakeholder engagement, an acknowledgment of the multiple dimensions at play, and the growing evidence of unpredictability of ICTs. The article emphasizes a perspective based on "contribution," not attribution; policymaking that is both adaptive and inclusive of multiple perspectives; methodological testing of emerging evaluation methodologies; and projects as learning experiments. This alternative theoretical and policymaking paradigm is encapsulated in a metaphor based on the management of natural resources where stakeholders track their own indicators of impact by reading how the system responds to a project intervention.
A bicmos Gm-C bandpass filter with Q enhancement based on symbolic design
Authors: Luis Abraham Sánchez Gaspariano, Arturo Prieto Fuenlabrada, Joel García Delgado
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

The utility and importance of symbolic analysis is well known in our area, i.e. Control Theory is not conceived without Mason's Rule. This article remarks this importance with some novel applications. Basic applications are exposed, general filters based on OTA (Transconductance Operational Amplifiers) Gm-C applications are also presented, the article finishes with a Q enhancement filter design using this technique. A new design was achieved for a second order bandpass filter (Gm-C), Q enhancement using OTAs and a single one way feedback path stage. TopSpice and Matlab results are also presented.
Evaluating product search and recommender systems for E-commerce environments
Authors: Pearl Pu, Li Chen, Pratyush Kumar
Venue: Electronic Commerce Research (2008)

Online systems that help users select the most preferential item from a large electronic catalog are known as product search and recommender systems. Evaluation of various proposed technologies is essential for further development in this area. This paper describes the design and implementation of two user studies in which a particular product search tool, known as example critiquing, was evaluated against a chosen baseline model. The results confirm that example critiquing significantly reduces users' task time and error rate while increasing decision accuracy. Additionally, the results of the second user study show that a particular implementation of example critiquing also made users more confident about their choices. The main contribution is that through these two user studies, an evaluation framework of three criteria was successfully identified, which can be used for evaluating general product search and recommender systems in E-commerce environments. These two experiments and the actual procedures also shed light on some of the most important issues which need to be considered for evaluating such tools, such as the preparation of materials for evaluation, user task design, the context of evaluation, the criteria, the measures and the methodology of result analyses.
Factorizations of complete multipartite graphs into generalized cubes
Authors: S. El--Zanati, C. Vanden Eynden
Venue: Journal of Graph Theory (2000)

For a positive integer d, the usual d-dimensional cube Qd is defined to be the graph (K2)d, the Cartesian product of d copies of K2. We define the generalized cube Q(Kk, d) to be the graph (Kk)d for positive integers d and k. We investigate the decomposition of the complete multipartite graph Kkj &times; kn - j into factors that are vertex-disjoint unions of generalized cubes Q(Kk, di), where k is a power of a prime, n and j are positive integers with j &le; n, and the di may be different in different factors. We also use these results to partially settle a problem of Kotzig on Qd-factorizations of Kn. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 144&ndash;150, 2000
Error-Tolerant SRAM Design for Ultra-Low Power Standby Operation
Authors: Huifang Qin, Animesh Kumar, Kannan Ramchandran, Jan Rabaey, Prakash Ishwar
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

We present an error-tolerant SRAM design optimized for ultra-low standby power. Using SRAM cell optimization techniques, the maximum data retention voltage (DRV) of a 90nm 26kb SRAM module is reduced from 550mV to 220mV. A novel error-tolerant architecture further reduces the minimum static-error-free VDD to 155mV. With a 100mV noise margin, a 255mV standby VDD effectively reduces the SRAM leakage power by 98% compared to the typical standby at 1V VDD.
IBM POWER6 accelerators: VMX and DFU
Authors: L. Eisen, J. W. Ward,  III, H.-W. Tast, N. Mäding, J. Leenstra, S. M. Mueller, C. Jacobi, J. Preiss, E. M. Schwarz, S. R. Carlough
Venue: IBM Journal of Research and Development (2007)

The IBM POWER6™ microprocessor core includes two accelerators for increasing performance of specific workloads. The vector multimedia extension (VMX) provides a vector acceleration of graphic and scientific workloads. It provides single instructions that work on multiple data elements. The instructions separate a 128-bit vector into different components that are operated on concurrently. The decimal floating-point unit (DFU) provides acceleration of commercial workloads, more specifically, financial transactions. It provides a new number system that performs implicit rounding to decimal radix points, a feature essential to monetary transactions. The IBM POWER™ processor instruction set is substantially expanded with the addition of these two accelerators. The VMX architecture contains 176 instructions, while the DFU architecture adds 54 instructions to the base architecture. The IEEE 754R Binary Floating-Point Arithmetic Standard defines decimal floating-point formats, and the POWER6 processor--on which a substantial amount of area has been devoted to increasing performance of both scientific and commercial workloads--is the first commercial hardware implementation of this format.
Developing an Intelligent Information Technology in Bioconversion of Agricultural Residue to Reducing Sugars
Authors: Xiao Mizhang, Xu Jingliang, Sun Yongming, Lu Pengmei, Dong Chunhua, Yuan Zhenhong, Zhuang Xinshu, Xiao Bo, Xiao Jianzhong, Luo Wen
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Intelligent Information System, based on mathematically modeling, data processing and experimental research, can help reduce the operating cost owing to fast reaction and effective control, and help disadvantaged users understand all useful information, which result in more profits and less loss. Framework of information processing, definitions of the concepts, regression equations, and economic evaluation of Intelligent Information System were discussed. Factors, including users' ability to understand, improvement of mathematical models, evaluation of production cost, and adaptation to changing environment, affect the efficiency of the intelligent information system. The experimental results obtained during pilot-scale fermentation suggested that Intelligent Information System benefited the bioconversion of agricultural residues to reducing sugars.
Sparsification-a technique for speeding up dynamic graph algorithms
Authors: D. Eppstein
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors provide data structures that maintain a graph as edges are inserted and deleted, and keep track of the following properties: minimum spanning forests, best swap, graph connectivity, and graph 2-edge-connectivity, in time O(n/sup 1/2/log(m/n)) per change; 3-edge-connectivity, in time O(n/sup 2/3/) per change; 4-edge-connectivity, in time O(n alpha (n)) per change; k-edge-connectivity, in time O(n log n) per change; bipartiteness, 2-vertex-connectivity, and 3-vertex-connectivity, in time O(n log(m/n)) per change; and 4-vertex-connectivity, in time O(n log(m/n)+n alpha (n)) per change. Further results speed up the insertion times to match the bounds of known partially dynamic algorithms. The algorithms are based on a technique that transforms algorithms for sparse graphs into ones that work on any graph, which they call sparsification.
An efficient architecture for bandwidth Brokers in DiffServ networks
Authors: Ch. Bouras, K. Stamos
Venue: International Journal of Network Management (2008)

In this article we examine the architecture of an entity used for automatic management and provisioning of resources for DiffServ networks. We examine the existing literature and implementations in this area, focusing on the design choices made, and we propose an architecture for the design of Bandwidth Brokers that combines an adaptive admission control algorithm for increased utilization of network resources and a mechanism for reducing the complexity overhead that intends to be both simple and effective. Specifically, we present a novel architecture for the admission control module that aims at achieving a satisfactory balance between maximizing the resource utilization for the network provider and minimizing the overhead of the module. We complement our theoretical discussion with extensive experimental simulations for the proposed Bandwidth Broker components and analysis of the results. The simulations study the possible configurations of the proposed algorithm and also compare it with alternative admission control policies.
Reducing the power consumption in wireless network by the use of Chvatal-Gomory strategy
Authors: Ivan Derpich, Manuel Nuñez, Mario López, Ismael Soto
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

This aim of this paper is to present a new methodology to reduce the power consumption in wireless applications. This new formulation adapts the hub and spoke model with constrains in the arcs to model the wireless channel and the use of Chvatal-Gomory strategy to generate a benefit of 8000% in the CPU time and a power saving of 30 dB allowing faster hub reallocation. Also comparison with standard methods and complexity studies are carried out.
Davis social links: integrating social networks with internet routing
Authors: Lerone Banks, Shaozhi Ye, Yue Huang, S. Felix Wu
Venue: Proceedings of the 2007 workshop on Large scale attack defense (2007)

Internet based communication systems appear in many forms from email to Instant Messenger and chat services to Voice over IP (VoIP). Common weaknesses of these current communication systems include inherent security vulnerabilities to attacks such as SPAM/SPIT/SPIM and DDoS, a lack of separation between routing address and identity, and a lack of message receiver controllability. Based on these observations, we describe preliminary ideas and analysis of a new communication architecture called DSL (Davis Social Links), which integrates the trust relationships of social networks into the internet communication infrastructure to provide receiver controllability, traceability, and global connectivity without centralized services or globally unique IDs. Although it is still in the early stages of development, we believe that DSL can help thwart many large-scale information-based attacks faced by the Internet community.
Micro process design and virtualization in the service industry
Authors: Raymond Wu
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this research we deal with the design stage by introducing the micro process and interconnectivity concept as the foundation of the service component design. Service virtualization is a new area requiring our attention as in the service industry all enterprise integration and industry silos need to be consolidated and form a main route. The service grid concept will provision a transparent and highly integrated framework to provide global service infrastructure which eliminates constraints in geography and the system we use. In this research paper we introduce a conceptual service provisioning with extension to interconnectivity as the service foundation. We further explore service virtualization based on the concept we introduced and on micro process design foundation.
Lower bounds for constant depth circuits in the presence of help bits
Authors: J.-Y. Cai
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The problem of how many extra bits of 'help' a constant depth circuit needs in order to compute m functions is considered. Each help bit can be an arbitrary Boolean function. An exponential lower bound on the size of the circuit computing m parity functions in the presence of m-1 help bits is proved. The proof is carried out using the algebraic machinery of A. Razborov (1987) and R. Smolensky (1987). A by-product of the proof is that the same bound holds for circuits with mod/sub p/ gates for a fixed prime p>2. The lower bound implies a random oracle separation for PH and PSPACE, which is optimal in a technical sense.
Automatic analysis for managing and optimizing performance-code quality
Authors: Lamia Djoudi, William Jalby
Venue: Proceedings of the 2008 workshop on Static analysis (2008)

Nowadays, compilers contain a large number of optimizations. As a result code performance is becoming more and more complex to guarantee, it is sensitive to butterfly effects, and difficult to assess without extensive tuning and experimenting. The three fundamental points for code optimization are to detect, understand and fix potential performance problems. Assessing precisely the quality of compiled code is essential to deliver high performance. Nowadays this issue is mostly tackled by using hardware counters and dynamic profiling. Static analysis, as we aim to illustrate in this paper, can achieve similar results at a much lower cost and with a better accuracy. We propose a different static / dynamic combination to achieve a trade-off between code quality and performance. Our approach uses static and dynamic analysis as a means to automatically select good compiler optimization settings for each innerloop.