ppxscal/embedding_network huggingface dataset:
VeriKey: A Dynamic Certificate Verification System for Public Key Exchanges
Authors: Brett Stone-Gross, David Sigal, Rob Cohn, John Morse, Kevin Almeroth, Christopher Kruegel
Venue: Proceedings of the 5th international conference on Detection of Intrusions and Malware, and Vulnerability Assessment (2008)

This paper presents a novel framework to substantiate self-signed certificates in the absence of a trusted certificate authority. In particular, we aim to address the problem of web-based SSL man-in-the-middle attacks. This problem originates from the fact that public keys are distributed through insecure channels prior to encryption. Therefore, a man-in-the-middle attacker may substitute an arbitrary public key during the exchange process and compromise communication between a client and server. Typically, web clients (browsers) recognize this potential security breach and display warning prompts, but often to no avail as users simply accept the certificate since they lack the understanding of Public Key Infrastructures (PKIs) and the meaning of these warnings. In order to enhance the security of public key exchanges, we have devised an automated system to leverage one or more vantage points of a certificate from hosts that have distinct pathways to a remote server. That is, we have a set of distributed servers simultaneously retrieve the server's public key. By comparing the keys received by peers, we can identify any deviations and verify that an attacker has not compromised the link between a client and server. This is attributable to the fact that an attacker would have to compromise all paths between these vantage points and the server. Therefore, our technique greatly reduces the likelihood of a successful attack, and removes the necessity for human interaction.
Group Representation Design of Digital Signals and Sequences
Authors: Shamgar Gurevich, Ronny Hadani, Nir Sochen
Venue: Proceedings of the 5th international conference on Sequences and Their Applications (2008)

In this survey a novel system, called the oscillator system, consisting of order of p 3 functions (signals) on the finite field $\mathbb{F}_{p},$ is described and studied. The new functions are proved to satisfy good auto-correlation, cross-correlation and low peak-to-average power ratio properties. Moreover, the oscillator system is closed under the operation of discrete Fourier transform. Applications of the oscillator system for discrete radar and digital communication theory are explained. Finally, an explicit algorithm to construct the oscillator system is presented.
Modeling document movement in corporate systems document circulation
Authors: N. B. Bakanova, V. M. Vishnevskii
Venue: Automation and Remote Control (2008)

Developed were a model and software complex for calculation of the characteristics required to design the architecture of a computerized document circulation system in a largescale organization with hierarchical control. The open stochastic network was used as a model adequately describing the main functions of the designed document circulation system.
Materializing Learning Objects with SCORM Specifications
Authors: Beril Ceylan, Mustafa Murat Inceoğlu
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

New ideas and tools facilitate our lives. The usage of computer and Internet technology in education has become one of the important issue these days. Learning mentality is changing with the help of technology and networks. Using digital materials makes our presentation more successful, but finding materials is a big problem. What specifications does a learning material have? How do we promote a learning object specialty? These are the questions firstly considered. We prepare a number of learning objects with SCORM specifications. Materials were prepared with Adobe Captivate 3.0 program. They were used in a lecture named Instructional Technology in Education. 23 students took part in both test groups and control groups. An experimental investigation was done with quantitative and qualitative data. A practice quiz made at the beginning and at the end of the experiment. Also students did an evaluation scale every lesson. In the end, an interview was carried out with the test group.
Eye, Me and the Environment
Authors: Fangmin Shi, Alastair Gale, Emilie Mollenbach
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

In order to broaden the applicability of an eye-tracking based assistive technology the available environmental control systems are reviewed. Their advantages and limitations are discussed with respect to their usage with eye tracking technology for aiding people with special needs. It is concluded that each system has its own distinct advantages for this task, linked also to their availability, ease of use and cost. Consequently a modular design approach is advocated for eye tracking control technologies in this domain to make them as generically applicable as possible.
Access to Mathematics and Science
Authors: Arthur I. Karshmer
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

The task of entering into careers in math and science is one of difficulty for all students. For the visually impaired student, the task is even more daunting. In our STS, we will hear a number of excellent papers and see several exciting demonstrations concerning making math, and therefore science, accessible to the visually impaired.
Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
Authors: Manfred Minimair
Venue: Computer Mathematics: 8th Asian Symposium, ASCM 2007, Singapore, December 15-17, 2007. Revised and Invited Papers (2008)

Division algorithms for univariate polynomials represented with respect to Lagrange and Bernstein basis are developed. These algorithms are obtained by abstracting from the classical polynomial division algorithm for polynomials represented with respect to the usual power basis. It is shown that these algorithms are quadratic in the degrees of their inputs, as in the power basis case.
Multiobjective Optimization of SLA-Aware Service Composition
Authors: Hiroshi Wada, Paskorn Champrasert, Junichi Suzuki, Katsuya Oba
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

In Service Oriented Architecture, each application is often designed as a set of abstract services, which defines its functions. A concrete service(s) is selected at runtime for each abstract service to fulfill its function. Since different concrete services may operate at different Quality of Service measures, application developers are required to select an appropriate set of concrete services that satisfies a given Service Level Agreement when a number of concrete services are available for each abstract service. This problem, the QoS-aware service composition problem, is known NP-hard, which takes a significant amount of time and costs to find optimal solutions (optimal combinations of concrete services) from a huge number of possible solutions. This paper proposes an optimization framework, called $E^3$, to address the issue. By leveraging a multiobjective genetic algorithm, E3 heuristically solves the QoS-aware service composition problem in a reasonably short time. The algorithm E3 proposes can consider multiple SLAs simultaneously and produce a set of Pareto solutions, which have the equivalent quality to satisfy multiple SLAs.
Multimedia Service Management for Home Networks with End to End Quality of Service
Authors: Ralf Seepold, Javier Martínez Fernández, Natividad Martínez Madrid
Venue: Proceedings of the 10th Asia-Pacific Network Operations and Management Symposium on Managing Next Generation Networks and Services (2007)

This article describes an architecture providing capabilities to integrate multimedia services into a hardware-independent platform, enabling services via dynamic remote configuration on demand, and finally, establishing end-to-end QoS connections between devices located in different home networks. Based on existing standards like OSGi, UPnP and SIP, a multimedia service management is developed that maintains the current standards but proposes capability extensions in order to cover more complex demands beyond a local (private) network.
Symbol Grounding for the Semantic Web
Authors: Anne M. Cregan
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

A true semantic web of data requires dynamic, real-time interopera-bility between disparate data sources, developed by different organizations in different ways, each for their own specific purposes. Ontology languages provide a means to relate data items to each other in logically well-defined ways, producing complex logical structures with an underlying formal semantics. Whilst these structures have a logical formal semantics, they lack a pragmatic semantics linking them in a systematic and unambiguous way to the real world entities they represent. Thus they are intricate "castles in the air", which may certainly have pathways built to link them together, but lack the solid foundations required for robust real-time dynamic interoperability between structures not mapped to each other in the design stage. Current ontology interoperability strategies lack such a meaning-based arbitrator, and depend instead on human mediation or heuristic approaches. This paper introduces the symbol grounding problem, explains its relevance for the Semantic Web, illustrates how inappropriate correspondence between symbol and referent can result in logically valid but meaningless inferences, examines some of the shortcomings of the current approach in dealing effectively at the level of meaning, and concludes with some ideas for identifying effective grounding strategies.
LabVIEW application for ultra-low power Wi-Fi sensor tags
Authors: Tom Savu, Marius Ghercioiu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

G2 Microsystems of Campbell, California, USA, released in 2007 the first ever ultra-low power Wi-Fi System on a Chip (SoC) named G2C501. This SoC includes a 32-bit CPU, crypto accelerator, real-time clock and a versatile sensor interface that can serve as a standalone host subsystem. The G2C501 goes beyond today's basic radio frequency identification (RFID) technology to offer intelligent tracking and sensor capabilities that leverage IEEE 802.11 (Wi-Fi) networks. Due to its support for multiple location technologies, small form factor and ultra-low power consumption, the G2C502 SoC can be integrated into Wi-Fi sensor tags that lower cost of ownership and meet the needs of a variety of industries including consumer electronics, pharmaceuticals, chemical manufacturing, cold chain and more. A battery powered, small size ultra low-power Wi-Fi wireless measurement node name IP Sensor has been built using the G2C501 SoC. Sensors for measurement of temperature, humidity, light, and vibration or motion are currently mounted on the IP Sensor board. The node is able to read a sensor and send data to the network by using an IP-based application protocol such as UDP. This paper describes the new IP Sensor device and gives a programming methodology using Lab VIEW.
Sliding-Tris: A Sliding Window Level-of-Detail Scheme
Authors: Oscar Ripolles, Francisco Ramos, Miguel Chover
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Virtual environments for interactive applications demand highly realistic scenarios, which tend to be large and densely populated with very detailed meshes. Despite the outstanding evolution of graphics hardware, current GPUs are still not capable of managing these vast amounts of geometry. A solution to overcome this problem is the use of level-of-detail techniques, which recently have been oriented towards the exploitation of GPUs. Nevertheless, although some solutions present very good results, they are usually based on complex data structures and algorithms. We thus propose a new multiresolution model based on triangles which is simple and efficient. The main idea is to modify the list of vertices when changing to a new level of detail, in contrast to previous models which modify the index list, which simplifies the extraction process. This feature also provides a perfect framework for adapting the algorithm to work completely on the GPU.
Personalised Mashups: Opportunities and Challenges for User Modelling
Authors: Minh Dang Thang, Vania Dimitrova, Karim Djemame
Venue: Proceedings of the 11th international conference on User Modeling (2007)

Web 2.0 has emerged as the business ideology and development paradigm for the next generation of web applications. This paper proposes the use of personalisation techniques to enhance the functionality of web mashups, one of the most popular Web 2.0 applications. A prototype of a personalised travel assistant which combines interactive maps with public data pulled from the Internet is presented. An experimental study with the prototype points at opportunities and challenges mashups bring to personalisation research.
How To Be Fickle
Authors: Vašek Chvátal
Venue: Proceedings of the 32nd international symposium on Mathematical Foundations of Computer Science 2007 (2007)

The backbone of many popular algorithms for solving NP-hard problems is implicit enumeration. There, the input problem is split into two or more subproblems by assigning some variable a new fixed value in each new subproblem --- this is called branching --- and the procedure is repeated recursively until the subproblems become easy enough to be dealt with directly.Unfortunate branching choices may have disastrous consequences: once you have branched, there is no turning back and you may be doomed to painfully replicate all your subsequent moves. In this sense, branching is like marrying in the Roman Catholic church: Branch in haste, repent at leisure.To some, the ominous prospect of irrevocable matrimony may supply the motivation for utmost care in choosing a spouse; others may prefer to choose spouses carelessly and to make divorce easy.An implementation of the former plan is the prototype of strong branching, first introduced in Concorde, a computer code for the symmetric traveling salesman problem: use first quick and coarse criteria to eliminate some of a large number of initial candidates in a first round, then slower and finer criteria to eliminate some of the remaining candidates in the next round, and so on in an iterative fashion.Two of the most popular implementations of the latter plan are dynamic backtracking of Matthew Ginsberg and GRASP of João Marques Silva and Karem Sakallah; one of the most neglected ones is resolution search. In reviewing resolution search, I will go into its origins, details, and extensions beyond the original presentation in 1995. In particular, I will point out that it can bridge the gap between certain local search heuristics and so-called exact algorithms.
Strategy of Digital Contents Archive Based on Reputation Model
Authors: Hiroyuki Kawano
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The size of the information society is increasing exponentially, many public organizations such as national libraries are making efforts top reserve born-digital scientific, artistic and cultural contents as knowledge infrastructure in our digital society. However, in order to handle huge volume of digital information, we have to solve various problems from social, legal and technical aspects. In this paper, from the view points of long-term preserving digital contents with good reputation of trustiness, uniqueness and valuation, we discuss strategies to preserve monotonously increasing digital contents provided by web systems. By applying our proposed reputation model, it makes possible to select socially important contents for archiving.
The 11th International Symposium on Flow Visualization
Authors: Thomas J. Mueller
Venue: Journal of Visualization (2005)

The 11th International Symposium on Flow Visualization (ISFV) was held at Notre Dame, IN, USA, August 8-12, 2004. The Symposium attracted 236 participants from around the world. The 52 Technical Sessions and two Poster Sessions covered a wide range of topics as indicated in the Keywords. Of the 182 submitted papers, 162 were presented. The presented papers included 8 invited lectures. Each morning and afternoon began with an invited lecture by an outstanding, recognized leader in the field. Toshio Kobayashi received the Leonardo da Vinci Award, an engraved plate, and presented the Leonardo da Vinci Memorial Lecture on "High-performance Computing and Visualization of Unsteady Turbulent Flows." Toshio Kobayashi is very well known for his outstanding contributions in computational science and flow visualization as well as his leadership in organizing conferences, workshops, and symposia on flow visualization. Ronald J. Adrian discussed "Visualization in Extreme Environments," Rolf H. Engler described "Pressure-sensitive Paints and Temperature-sensitive Paints in Quantitative Wind Tunnel Studies," William K. Blake explained "Cavitation as Flow Visualization Seeding," Giovanni M. Carlomagno discussed "The Use of Colors in Thermo-fluid Dynamic Studies," Ajit Yoganathan presented "A Gallery of Cardiovascular Fluid Flow Fields: From Heart Valves to Congenital Heart Disease," Richard B. Miles described "Flow Visualization by Filtered Molecular and Particular Scattering," and Thomas C. Gruber Jr., displayed a technique for "Visualization of Foreign Gases in Atmospheric Air." At the end of the last day, Jurgen Kompenhaus from DLR discussed the 12th ISFV to be held in Germany in 2006. After this presentation there was a tour of the Hessert Laboratory for Aerospace Research.
Semantic Technologies in System Maintenance (STSM 2008)
Authors: Juergen Rilling, René Witte, Dragan Gaevic, Jeff Z. Pan
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

This paper gives a brief overview of the International Workshop on Semantic Technologies in System Maintenance. It describes a number of semantic technologies (e.g., ontologies, text mining, and knowledge integration techniques) and identifies diverse tasks in software maintenance where the use of semantic technologies can be beneficial, such as traceability, system comprehension, software artifact analysis, and information integration.
Increasing Precision of Credible Case-Based Inference
Authors: Thomas Gabel, Martin Riedmiller
Venue: Proceedings of the 9th European conference on Advances in Case-Based Reasoning (2008)

Credible case-based inference (CCBI) is a new and theoretically sound inferencing mechanism for case-based systems. In this paper, we formally investigate the level of precision that CCBI-based retrieval results may yield. Building upon our theoretical findings, we derive a number of optimization criteria that can be utilized for learning such similarity measures that bring about more precise predictions when used in the scope of CCBI. Our empirical experiments support the claim that, given appropriate similarity measures, CCBI can be enforced to produce highly precise predictions while its corresponding level of confidence is only marginally impaired.
Automatic Video Summarization by Spatio-temporal Analysis and Non-trivial Repeating Pattern Detection
Authors: Ruo-gui Xiao, Yan-yun Wang, Hong Pan, Fei Wu
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Video content summarization provides an effective way to accelerating video browsing and retrieval. In this paper, we propose a novel approach to automatically generate the video summary. Firstly, the video structure is analyzed by spatio-temporal analysis. Then, we detect video non-trivial repeating patterns to remove the visual-content redundancy among video stream. Moreover, an importance evaluation model (IEM) is adopted to automatically determine the importance of each video shot according to the user need. This aims to construct video summarization with the most informative shots selected from groups of similar shots. Experimental results indicate that the proposed algorithm is more effective than existing approaches in video summarization generation.
A Grid and Density-Based Clustering Algorithm for Processing Data Stream
Authors: Chen Jia, ChengYu Tan, Ai Yong
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

This paper proposes DD-Stream, a framework for density-based clustering stream data. The algorithm adopts a density decaying technique to capture the evolving data stream and extracts the boundary point of grid by the DCQ-means algorithm. Our method resolving the problem of evolving automatic clustering of real-time data streams, can not only find arbitrary shaped clusters with noise, but also avoid the clustering quality problems caused by discarding the boundary point of grid, our algorithm has better scalability in processing large-scale and high dimensional stream data as well.
Feasible Iteration of Feasible Learning Functionals
Authors: John Case, Timo Kötzing, Todd Paddock
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

For learning functions in the limit, an algorithmic learner obtains successively more data about a function and calculates trials each resulting in the output of a corresponding program, where, hopefully, these programs eventually converge to a correct program for the function. The authors desired to provide a feasible version of this learning in the limit -- a version where each trial was conducted feasibly and there was some feasible limit on the number of trials allowed. Employed were basic feasible functionals which query an input function as to its values and which provide each trial. An additional tally argument 0 i was provided to the functionals for their execution of the i-th trial. In this way more time resource was available for each successive trial. The mechanism employed to feasibly limit the number of trials was to feasibly count them down from some feasible notation for a constructive ordinal. Since all processes were feasible, their termination was feasibly detectable, and, so, it was possible to wait for the trials to terminate and suppress all the output programs but the last. Hence, although there is still an iteration of trials, the learning was a special case of what has long been known as total Fin-learning, i.e., learning in the limit, where, on each function, the learner always outputs exactly one conjectured program. Our general main results provide for strict learning hierarchies where the trial count down involves all and only notations for infinite limit ordinals. For our hierarchies featuring finitely many limit ordinal jumps, we have upper and lower total run time bounds of our feasible Fin-learners in terms of finite stacks of exponentials. We provide, though, an example of how to regain feasibility by a suitable parameterized complexity analysis.