ppxscal/embedding_network huggingface dataset:
Finite field elements of high order arising from modular curves
Authors: Jessica F. Burkhart, Neil J. Calkin, Shuhong Gao, Justine C. Hyde-Volpe, Kevin James, Hiren Maharaj, Shelly Manber, Jared Ruiz, Ethan Smith
Venue: Designs, Codes and Cryptography (2009)

In this paper, we recursively construct explicit elements of provably high order in finite fields. We do this using the recursive formulas developed by Elkies to describe explicit modular towers. In particular, we give two explicit constructions based on two examples of his formulas and demonstrate that the resulting elements have high order. Between the two constructions, we are able to generate high order elements in every characteristic. Despite the use of the modular recursions of Elkies, our methods are quite elementary and require no knowledge of modular curves. We compare our results to a recent result of Voloch. In order to do this, we state and prove a slightly more refined version of a special case of his result.
Experiments in Ubiquitous Computing for Communities of Practice Using Learning Resources
Authors: Amel Bouzeghoub, Pierre-André Caron, Sarra Kaddouci, Claire Lecocq, Xavier Le Pallec, François-Julien Ritaine, José Rouillard
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

We present in this paper the interest of ubiquitous computing for the so called contextualized forums. These forums allow communities of practice exchanging and sharing experiences or situations already lived by using learning documents to classify these exchanges. These forums contain a lot of information which contribute to improve classical training. We study here ubiquitous computing possibilities to use this type of forums in order to improve professional training to business process by helping the user to put his/her acquisition into practice. The developed application is being tested and works mainly on smartphones.
Effective use of computers
Authors: Marvin M. Wofsey, James V. Milano, Phillip J. London, Robert L. Johnson, Phillip C. Howard
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This panel focuses on the critical areas of evaluation in order to promote effective computer installations. Comparatively short papers will be presented on: evaluating computer installations, evaluating programs before they are put on the computer, reevaluating programs after they are running on the computer, and what management should know about the performance of their system. These will be followed by a panel discussion.
Modern OpenGL usage: using vertex buffer objects well
Authors: Mark J. Kilgard
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

This whitepaper is a follow-up to an article titled Avoiding 16 Common OpenGL Pitfalls written back in 1998 for a course on OpenGL game development at the (then-named) Computer Game Developers Conference, now known as the Game Developer Conference (GDC). This new whitepaper focuses on what to do---instead of what to avoid---to get the most out of modern OpenGL implementations.
Locating GPS coordinates on PDA
Authors: Nicolae-Iulian Enescu, Dan Mancas, Ecaterina - Irina Manole
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

The purpose of our research is to find algorithms for loading large maps on PDA and place on them the geographical location given by latitude and longitude. C++ and C# programming languages have been used for implementation. It was elaborated a software which runs on PDA with Windows Mobile 2003 OS and implements algorithms for finding the coordinate on a map represented like a TIF image. The application must localize the coordinates known by longitude and latitude over a given image in TIF format which can represent a map with scale 1:200000 or 1:25000. The map headers contain information that refer to map limit. An algorithm that permits map synchronization when the value of current map is out of limit it was necessary.
Ontologies for Production Automation
Authors: Jose L. Martinez Lastra, Ivan M. Delamer
Venue: Advances in Web Semantics I: Ontologies, Web Services and Applied Semantic Web (2008)

The manufacturing sector is currently under pressures to swiftly accommodate new products by quickly setting up new factories or retrofitting existing ones. In order to achieve this goal, engineering tasks currently performed manually need to be automated. In this scenario, ontologies emerge as a candidate solution for representing knowledge about manufacturing processes, equipment, and products in a machine-interpretable way. This knowledge can then be used by automated problem-solving methods to (re)configure the control software that coordinates and supervises manufacturing systems. This chapter reviews current approaches to use ontologies in the manufacturing domain, which include use for vocabulary definition in multi-agent systems and use for describing processes using Semantic Web Services. In addition, current and emerging research trends are identified.
A full-factory simulator as a daily decision-support tool for 300mm wafer fabrication productivity
Authors: Sugato Bagchi, Ching-Hua Chen-Ritzo, Sameer T. Shikalgar, Michael Toner
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We describe a discrete event simulator developed for daily prediction of WIP position in an operational 300mm wafer fabrication factory to support tactical decision-making. The simulator is distinctive in that its intended prediction horizon is relatively short, on the order of a few days, while its modeling scope is relatively large. The simulation includes over 90% of the wafers being processed in the fab and all process, measurement and testing tools. The model parameters are automatically updated using statistical analyses performed on the historical event logs generated by the factory. This paper describes the simulation model and the parameter estimation methods. A key requirement to support daily and weekly decision-making is good validation results of the simulation against actual fab performance. Therefore, we also present validation results that compare simulated production metrics against those obtained from the actual fab, for fab-wide, process, tool and product specific metrics.
"When I am on Wi-Fi, I am fearless": privacy concerns & practices in eeryday Wi-Fi use
Authors: Predrag Klasnja, Sunny Consolvo, Jaeyeon Jung, Benjamin M. Greenstein, Louis LeGrand, Pauline Powledge, David Wetherall
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Increasingly, users access online services such as email, e-commerce, and social networking sites via 802.11-based wireless networks. As they do so, they expose a range of personal information such as their names, email addresses, and ZIP codes to anyone within broadcast range of the network. This paper presents results from an exploratory study that examined how users from the general public understand Wi-Fi, what their concerns are related to Wi-Fi use, and which practices they follow to counter perceived threats. Our results reveal that while users understand the practical details of Wi-Fi use reasonably well, they lack understanding of important privacy risks. In addition, users employ incomplete protective practices which results in a false sense of security and lack of concern while on Wi-Fi. Based on our results, we outline opportunities for technology to help address these problems.
Recoverable class loaders for a fast restart of Java applications
Authors: Vladimir Nikolov, Rüdiger Kapitza, Franz J. Hauck
Venue: Mobile Networks and Applications (2009)

We present recoverable class loaders to enable a fast start-up and recovery of Java applications. This is achieved by snapshooting the static state of Java applications namely the class loaders and their associated class objects, which are then recovered during subsequent restarts. Recoverable class loaders are especially useful in the context of mobile applications and mobile services. First, they allow to speed up shutdown and restart of applications for power- and resource-management reasons on resource-restricted mobile devices. Second, services can be much faster rebooted to cure software faults such as memory leaks thereby improving the availability of services. We implemented recoverable class loaders inside the JamVM and the OSGi middleware Oscar. For both cases of use--Java application restart and service recovery--we provide experimental evaluations that show a substantially reduced start-up time from up to 96%.
Towards Novel Approaches in Design Automation for FPGA Power Optimization
Authors: Juanjo Noguera, Robert Esser, Katarina Paulsson, Michael Hübner, Jürgen Becker
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

The exploitation of reconfigurable architectures is currently increasing for high-performance applications e.g. signal processing systems. Until now however, general purpose processors are typically applied for lowpower applications partly due to the un-optimized design process of FPGA systems. Currently, the increasing requirements even on low-power applications force the investigation of alternative architectures such as FPGAs to enable higher flexibility for such applications. This paper presents a multi-level overview of power optimization for FPGA-based systems. Several novel design considerations for power reduction are described and discussed as well as the achieved results. The main objective of the presented work is to enable the flexibility of reconfigurable architectures even for low-power applications.
Computers helping dance notation help the dance: a vision
Authors: Stephen W. Smoliar
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The production of a ballet is one of the most frustrating endeavors in the performing arts today. The frustration stems from the fact that a substantial amount of information must be shared among a large number of individuals, and the only manifestation of this information is in a few human memories. Often the information is evolving: a choreographer will work from day to day with a company of dancers, saving only a fraction of material from one day to the next, until, eventually, the "vision" of a complete piece of choreography has been formed. Alternatively, in the case of reconstructing a piece of choreography, disagreements inevitably arise as to whose memory of the original is most accurate. In the absence of any "hard" information, such disagreements can only be resolved by the strength of authority.
On an algorithm determining direct superclasses in Java and similar languages with inner classes---Its correctness, completeness and uniqueness of solutions
Authors: Hans Langmaack, Andrzej Salwicki, Marek Warpechowski
Venue: Information and Computation (2009)

Some object oriented programming languages allow inner classes. All of them admit inheritance. This combination of inner classes and inheritance is very fruitful however less known. On the other hand it creates a serious problem: how to determine the direct superclass of a given class C, i.e. the class which class C directly inherits from. For there may be several classes of the same name in one program. A specification of the problem and a non-deterministic algorithm are provided. We prove that the algorithm is correct w.r.t. the specification and complete, i.e. if the algorithm signals an error then no solution exists. We show that the specification itself has at most one solution, in other words, it is a complete specification. This proves also that the corresponding parts of Java Language Specification are consistent and define uniquely a fragment of Java semantics.
Exploring the effect of directory depth on file access for FAT and NTFS file systems
Authors: Faraz Ahsan, M. Ikram Lali, Imran Ahmad, A. F. M. Ishaq, S. Mohsin
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

Normally data consisting of different files is logically separated by the user and is physically spread across different directories accordingly, for convenience in relocating and easy retrieval. Depending on the data categorization, these directories can be multi-level in nature, each of which can itself contain many further sub-directories. Thus, data stored on a file system is usually hierarchical in nature. However, this approach affects the performance of the file system, as it requires navigating the whole path step by step to locate a file. Researchers have developed different benchmarking applications for measuring performance of file systems. Existing file system benchmarks do not capture performance in terms of the directory depth and the file access paths. We developed a benchmark application which measures the file system performance with respect to file access on different directory depth. Our results showed that beyond the directory depth of 5, there is a significant increase in the penalty involved in accessing a file on a server for FAT and NTFS file systems.
Firefighting on Trees: (1 - 1/e)---Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
Authors: Leizhen Cai, Elad Verbin, Lin Yang
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The firefighter problem is defined as follows. Initially, a fire breaks out at a vertex r of a graph G. In each subsequent time unit, a firefighter chooses a vertex not yet on fire and protects it, and the fire spreads to all unprotected neighbors of the vertices on fire. The objective is to choose a sequence of vertices for the firefighter to protect so as to save the maximum number of vertices. The firefighter problem can be used to model the spread of fire, diseases, computer viruses and suchlike in a macro-control level. In this paper, we study algorithmic aspects of the firefighter problem on trees, which is NP-hard even for trees of maximum degree 3. We present a (1 - 1/e)-approximation algorithm based on LP relaxation and randomized rounding, and give several FPT algorithms using a random separation technique of Cai, Chan and Chan. Furthermore, we obtain an $2^{O(\sqrt{n}\log n)}$-time subexponential algorithm.
Minimizing Average Flow Time in Sensor Data Gathering
Authors: Vincenzo Bonifaci, Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

Building on previous work [Bonifaci et al., Minimizing flow time in the wireless gathering problem, STACS 2008] we study data gathering in a wireless network through multi-hop communication with the objective to minimize the average flow time of a data packet. We show that for any the problem is NP-hard to approximate within a factor better than , where m is the number of data packets. On the other hand, we give an online polynomial time algorithm that we analyze using resource augmentation. We show that the algorithm has average flow time bounded by that of an optimal solution when the clock speed of the algorithm is increased by a factor of five. As a byproduct of the analysis we obtain a 5-approximation algorithm for the problem of minimizing the average completion time of data packets.
A family of dynamic finite difference schemes for large-eddy simulation
Authors: Dieter Fauconnier, Chris De Langhe, Erik Dick
Venue: Journal of Computational Physics (2009)

A family of dynamic low-dispersive finite difference schemes for large-eddy simulation is developed. The dynamic schemes are constructed by combining Taylor series expansions on two different grid resolutions. The schemes are optimized dynamically during the simulation according to the flow physics and dispersion errors are minimized through the real-time adaption of the dynamic coefficient. In case of DNS-resolution, the dynamic schemes reduce to the standard Taylor-based finite difference schemes with formal asymptotic order of accuracy. When going to LES-resolution, the schemes seamlessly adapt to dispersion-relation preserving schemes. The schemes are tested for large-eddy simulation of Burgers' equation and numerical errors are investigated as well as their interaction with the subgrid model. Very good results are obtained.
Territorial coordination and workspace awareness in remote tabletop collaboration
Authors: Philip Tuddenham, Peter Robinson
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

There is growing interest in tabletop interfaces that enable remote collaboration by providing shared workspaces. This approach assumes that these remote tabletops afford the same beneficial work practices as co-located tabletop interfaces and traditional tables. This assumption has not been tested in practice. We explore two such work practices in remote tabletop collaboration: (a) coordination by territorial partitioning of space; and (b) transitioning between individual and group work within a shared task. We have evaluated co-located and remote tabletop collaboration. We found that remote collaborators did not coordinate territorially as co-located collaborators did. We found no differences between remote and co-located interfaces in their ability to afford individual and group work. However, certain interaction techniques impaired the ability to transition fluidly between these working styles. We discuss causes and the implications for the design and future study of these interfaces.
Compound Node–Kayles on paths
Authors: Adrien Guignard, Éric Sopena
Venue: Theoretical Computer Science (2009)

In his celebrated book [J.H. Conway, On Numbers and Games, Academic Press, New-York, 1976, Second edition (2001), A.K. Peters, Wellesley, MA], J.H. Conway introduced twelve versions of compound games. We analyze these twelve versions for the Node-Kayles game on paths. For usual disjunctive compound, Node-Kayles has been solved for a long time under normal play, while it is still unsolved under misere play. We thus focus on the ten remaining versions, leaving only one of them unsolved.
Dojo, now with drawing tools!
Authors: Matthew Russell
Venue: Linux Journal (2009)

The Dojo Toolkit packs a 2-D drawing library that exposes a uniform cross-browser API and works on all of the mainstream browsers.
Facts or friends?: distinguishing informational and conversational questions in social Q&A sites
Authors: F. Maxwell Harper, Daniel Moy, Joseph A. Konstan
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Tens of thousands of questions are asked and answered every day on social question and answer (Q&A) Web sites such as Yahoo Answers. While these sites generate an enormous volume of searchable data, the problem of determining which questions and answers are archival quality has grown. One major component of this problem is the prevalence of conversational questions, identified both by Q&A sites and academic literature as questions that are intended simply to start discussion. For example, a conversational question such as "do you believe in evolution?" might successfully engage users in discussion, but probably will not yield a useful web page for users searching for information about evolution. Using data from three popular Q&A sites, we confirm that humans can reliably distinguish between these conversational questions and other informational questions, and present evidence that conversational questions typically have much lower potential archival value than informational questions. Further, we explore the use of machine learning techniques to automatically classify questions as conversational or informational, learning in the process about categorical, linguistic, and social differences between different question types. Our algorithms approach human performance, attaining 89.7% classification accuracy in our experiments.
Software faults prediction based on grey system theory
Authors: Chengying Mao
Venue: ACM SIGSOFT Software Engineering Notes (2009)

Whenever a new maintenance stage is started or a new software version is released, it is necessary to predict the possible number of failures. The data sequence recorded during software maintenance is characterized by small samples and uncertainty, so the modeling technology in grey system theory is very suitable for handling such data. The paper proposed the basic prediction framework based on grey model GM(1, 1) firstly, and then two prediction models and implementation steps are represented according to two special applications, respectively. One is used for interval prediction of software faults, and the other is used for predicting fault number with the direction of related factors recorded during software maintenance process. The results of two examples showed that using three different techniques for three different cases can achieved more accurate prediction.
A Two-Dimensional Hybrid Logic of Subset Spaces
Authors: Yi N. Wang
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Logics of space typically involve two sorts of entities, points and sets, and so are amenable for investigation using hybrid modal languages with nominals for both sorts. As Hilbert systems for these logics are quite complicated, Gentzen systems are used in this paper, first for the basic two-dimensional hybrid logic and then for the logic of subset spaces, which needs additional rules. This provides a foothold from which to consider extensions to neighborhood and topological logics, and also application fields such as epistemic and doxastic logics.
The Chain-Control-System of Environmental Parameters for Beer Fermentation Process
Authors: Tie-jun Chen, Gai-jie Hou
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

In order to improve the final rate of output, and guarantee, there is a suitable growth metabolite environment for beer fermentation process. Chain-control-system is introduced. Two factors are found out which are fermentation temperature and PH, then the chain-control-system models are built which include temperature chain and PH chain, and these chains influence each other. The chain estimating arithmetic and control system of environmental parameter for beer fermentation process are designed. Emulation results show that the chain systematic model of environmental parameter for beer fermentation process is great stability and strong anti-interference ability.
Mobile Positioning Using Enhanced Signature Database Method and Error Reduction in Location Grid
Authors: Mohammad Taghi Manzuri, Ali Mehdizadeh Naderi
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

There are some methods to Mobile location determination; one of these methods is Signal Strength (Power of Arrivals). In this research, Mobile Location Determination using enhanced signature database method in a Location grid will be introduced; sever always for positioning error reduction will also be described.