ppxscal/embedding_network huggingface dataset:
Elements of a National SemanticWeb Infrastructure--Case Study Finland on the Semantic Web
Authors: Eero Hyvonen, Kim Viljanen, Eetu Makela, Tomi Kauppinen, Tuukka Ruotsalo, Onni Valkeapaa, Katri Seppala, Osma Suominen, Olli Alm, Robin Lindroos, Teppo Kansala, Riikka Henriksson, Matias Frosterus, Jouni Tuominen, Reetta Sinkkila, Jussi Kurki
Venue: Proceedings of the International Conference on Semantic Computing (2007)

This article presents the vision and results of creating the basis for a national semantic web content infrastructure in Finland in 2003-2007. The main elements of the infrastructure are shared and open metadata schemas, core ontologies, and public ontology services. Several practical applications testing and demonstrating the usefulness of the infrastructure are overviewed in the fields of eCulture, eHealth, eGovernment, eLearning, and eCommerce.
Packet Filtering Based on Source Router Marking and Hop-Count
Authors: Kashif Ali, Mohammad Zulkernine, Hossam Hassanein
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Denial of Service (DoS) attacks impose an increasingly growing threat to the Internet. These attacks result in wastage of scarce Internet resources and service disruptions. Existing packet filtering schemes are deployable at either source, intermediate or victim networks. In this paper, we propose a hybrid of the source and the victim networks-based packet filtering approach, Source Router marking and Hop-Count (SRHC), to detect and filter high-rate traffic flows and IP-spoofing attacks. Packets are marked at the source network based on their arrival rate threshold. At a victim network, the spoofed packets are marked based on the IP source arrival rate using their respective TTL value. Both source and victim networks collaborate to filter high-rate and IP-spoofing attacks. The ns-2 simulator is used to generate attack scenarios. Our simulation results show that the SRHC scheme effectively filters out high-rate and IP-spoofing attack packets, with minimal collateral damage.
Trust and cooperation from a fuzzy perspective
Authors: M. S. Al-Mutairi, K. W. Hipel, M. S. Kamel
Venue: Mathematics and Computers in Simulation (2008)

The well-known game of Prisoner's Dilemma, which reflects a basic situation in which one must decide whether or not to cooperate with a competitor, is systematically solved using a fuzzy approach to modeling trust. When involved in a dispute, two or more parties need to make decisions with fully or partially conflicting objectives. In situations where reaching a more favorable outcome depends upon cooperation and trust between the two conflicting parties, some of the mental and subjective attitudes of the decision makers must be considered. While the decision to cooperate with others bears some risks due to uncertainty and loss of control, not cooperating means giving up potential benefits. In practice, decisions must be made under risk, uncertainty, and incomplete or fuzzy information. Because it is able to work well with vague, ambiguous, imprecise, noisy or missing information, the fuzzy approach is effective for modeling such multicriteria conflicting situations. The fuzzy procedure is used to take into account some of the subjective attitudes of the decision makers, especially with respect to trust, that are difficult to model using game theory.
Integrated Support for Product Configuration and Requirements Engineering in Product Derivation
Authors: Rick Rabiser, Deepak Dhungana
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Deriving a product from a product line means selecting and configuring existing reusable assets to meet a particular customer's needs. The blue-sky scenario in product derivation is that all customer requirements can be satisfied by exploiting existing assets and their variability. The more realistic scenario, however, is that the customers will have additional wishes and requirements that are not covered by the product line. We therefore need integrated support for both product configuration and requirements engineering tasks. New requirements captured during the sales process need to be related to existing assets. In this paper we present a tool-supported approach for integrated product configuration and requirements engineering. We illustrate the approach using a scenario developed in our research collaboration with a leading company in the steel plant building domain.
Castalia: revealing pitfalls in designing distributed algorithms in WSN
Authors: Athanassios Boulis
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

We present Castalia, a simulator for WSN that models many aspects of the WSN system and uses advanced models especially in terms of the channel and radio behaviour. We show the effects of these features in distributed algorithms that work fine with simpler simulators but fail under Castalia. The demo will present the differences, explain the failures and show how to redesign the algorithms to make them work under more realistic conditions.
Delay Uncertainty Reduction by Interconnect and Gate Splitting
Authors: Vineet Agarwal, Jin Sun, Alexander Mitev, Janet Wang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Traditional timing variation reduction techniques are only able to decrease the gate delay variation by incurring a delay overhead. In this work, we propose novel and effective splitting based variation reduction techniques for both interconnect and gate. We developed a new tool called TURGIS: Timing Uncertainty Reduction by Gate-Interconnect Splitting which reduces the timing variations of a circuit and presents little delay overhead at the primary output. It is shown that using splitting on interconnect can reduce the Chemical-Mechanical Polishing (CMP) induced dishing effect and can result in decrease at an average of 5% in mean interconnect delay in addition to its variation. Improvements of up to 30% are achieved on timing variation for gates of various size while reduction of 55% can be observed in interconnect delay variation.
4G Wireless Begins to Take Shape
Authors: Sixto Ortiz Jr.
Venue: Computer (2007)

The ITU's 4G cellular standard would provide technology enabling IP-based voice, data, and streaming multimedia at higher speeds than current cellular approaches.
Interviews3D: A Platform for Interactive Handling of Massive Data Sets
Authors: Beat Brüderlin, Mathias Heyer, Sebastian Pfützner
Venue: IEEE Computer Graphics and Applications (2007)

Interviews3D confronts the CAD data explosion problem with new approaches that let users process fully detailed 3D models in real time, even on standard PCs or 32-bit laptops. It has demonstrated efficiency in real-time rendering and clash detection for automotive, aerospace, and construction models too large for previous systems.
Swap and mismatch edit distance
Authors: Amihood Amir, Estrella Eisenberg, Ely Porat
Venue: Algorithmica (2006)

There is no known algorithm that solves the general case of theapproximate string matching problem with the extended edit distance, where the edit operations are: insertion, deletion, mismatch and swap, in timeo(nm), wheren is the length of the text andm is the length of the pattern. In an effort to study this problem, the edit operations were analysed independently. It turns out that the approximate matching problem with only the mismatch operation can be solved in timeO(n &#x221a;m logm). If the only edit operation allowed is swap, then the problem can be solved in timeO(n logm log&#x03c3;), where&#x03c3;=min(m, |&#x03a3;|). In this paper we show that theapproximate string matching problem withswap andmismatch as the edit operations, can be computed in timeO(n &#x221a;m logm).
Performance Analysis of Genetic Algorithm for the Design of Linear Phase Digital Filter Banks with CSD Coefficients
Authors: P. Samadi, M. Ahmadi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

In this paper Genetic Algorithm is utilized to design linear phase IIR Quadrature Mirror Filter (QMF) banks with Canonical Signed Digit Coefficients (CSD). Subsequently, we present a through study on the performance of GA using different cross-over strategies. It is shown that 2-point cross-over generally works better than 1-point and uniform cross-over for IIR filter design. In the second part, the dependency of Genetic Algorithm to probability of mutation (Pm) and Probability of Cross-over (Pc) is analyzed. Experimental results show that with a fixed value for Pc, Genetic Algorithm performs better with the Pm of 4 to 6 percent, and with a fixed value for Pm, Genetic Algorithm yields better result with the Pc of around 95 percent.
Using reputation to augment explicit authorization
Authors: Phillip J. Windley, Devlin Daley, Bryant Cutler, Kevin Tew
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

Online social networks are formed when web applications allow users to contribute to an online community. The explosive growth of these social networks taxes the management capacity of human administrators. The continued health of an online social network depends upon the identification and utilization of users who make positive contributions to the community, but finding these individuals can be difficult. In addition, these contributing users must be explicitly granted authority to help maintain and grow these networks. Automated reputation calculations based on user contributions and behavior can be used as an effective substitute for explicit authorization, giving online social networks greater flexibility and scalability. In this paper, we examine the underlying principles of online reputation, introduce Pythia, a flexible reputation system framework, and demonstrate the use of reputation calculations to augment explicit authorization in a web application.
Practical method for obtaining a feasible integer solution in hierarchical layout optimization
Authors: Xiaoping Tang, Xin Yuan, Michael S. Gray
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Layout optimization is a powerful technique for design migration, circuit performance tuning and design for manufacturing. In this paper, we study the problem of layout optimization for the hierarchical circuits in modern VLSI designs which essentially can be formulated as the Integer Linear Programming(ILP) problem. Existing approaches are either unable to handle hierarchy, inefficient or failing to provide the feasible integer solutions for large scale hierarchical layouts. We present a practical method, IRLS algorithm (Iteratively Rounding and LP Solving) which consists of a proper rounding strategy based on the careful analysis of hierarchical layout constraints, to obtain a feasible integer solution in the constraint-based layout modification process, thus enabling efficient optimization for large scale hierarchical layouts, and specifically avoiding the need to use the general ILP solvers. Experimental results demonstrate the efficiency and effectiveness of the IRLS algorithm. Compared with the general ILP/MILP solver, the IRLS algorithm can obtain decent results with much less runtime (speed-up ranging from 4,000X to 360,000X). Compared with the two-step approach[2] on legalizing a set of large scale industry circuit layouts, the IRLS algorithm can provide much better solution (satisfying all abutment/alignment constraints that the two-step approach fails to meet).
A Trust Aware Access Control in Service Oriented Grid Environment
Authors: Xudong Ni, Junzhou Luo
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Ensuring secure and authorized access to grid services in a dynamic, heterogeneous grid environment is a challenging task. As an important factor in grid security, trust is increasingly applied to management of security, especially in access control. Two major issues that need to be addressed in this regard are: management of trust and an effective access model. In this paper, we propose an access control framework with aware of trust level, which is a value according with trust degree. It can satisfy the requirement in grid service and the simulation verifies its correctness and performance.
The history of histograms (abridged)
Authors: Yannis Ioannidis
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

The history of histograms is long and rich, full of detailed information in every step. It includes the course of histograms in different scientific fields, the successes and failures of histograms in approximating and compressing information, their adoption by industry, and solutions that have been given on a great variety of histogram-related problems. In this paper and in the same spirit of the histogram techniques themselves, we compress their entire history (including their "future history" as currently anticipated) in the given/fixed space budget, mostly recording details for the periods, events, and results with the highest (personally-biased) interest. In a limited set of experiments, the semantic distance between the compressed and the full form of the history was found relatively small!
Automatic Audio Classification and Speaker Identification for Video Content Analysis
Authors: Shu-Chang Liu, Jing Bi, Zhi-Qiang Jia, Rui Chen, Jie Chen, Min-Min Zhou
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Recently, more literatures proposed to apply audio content analysis techniques in content-based video parsing. This paper presents our works on audio classification and speaker identification techniques for video content analysis. Firstly, soundtrack extracted from video stream is partitioned into homogeneous segments using rule and Support Vector Machine(SVM) based classifier. Secondly, fixed-length speech clips randomly selected from speech segments are clustered into several clusters based on spectral clustering techniques. The clustered speech feature datasets initialize and train Gaussian Mixture Model(GMM) for each speaker. Finally, the trained GMMs accomplish speaker identification. Experimental results confirm the validity of the proposed scheme.
Preserving Consistency Based on Wall-Time Precedence in P2P DVEs
Authors: Liping Gao, Ning Gu
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Based on the analysis of the work mode of peer-to- peer (P2P) Distributed Virtual Environments (DVEs), the paper proposes the ideal and relaxed consistency model, and introduces wall-time as the basis of the precedence order. Then the Status-Retrace algorithm based on wall-time precedence is proposed to realize the synchronization of parallel actions from local and remote sites. Quick-response-wins strategy is introduced to process the wall-time conflict operations and direct precedence, causal precedence based on logical time is also inducted to repair visual confusion caused by Status-Retrace method. The contrast experiments show the advantages of the newly developed algorithm in highly concurrent environment. Keywords: DVEs; consistency maintenance; Status- Retrace; wall-time precedence
Semantically supported Authentication and Privacy in Social Networks
Authors: Josef Noll, Mohammad M. R. Chowdhury, Gyorgy Kalman, Juan Miguel Gomez
Venue: Proceedings of the The International Conference on Emerging Security Information, Systems, and Technologies (2007)

Service access in a ubiquitous computing and pervasive Internet environment has reached a new dimension. It is not longer a question of enabling services for customers, but to design a convenient and trusted service usage. While semantic services open for a description of user preferences, profiles and social groups, privacy handling is not addressed so far. Social communities based on friend of a friend (foaf) principles, LinkedIn, or Facebook are open for all registered users, thus data about yourself are spread all-around. This paper presents an architecture to enable social networks to enable privacy, based on the identity of the user. Focus is on the semantic description of user's role in social networks and on securing the access through appropriate authentication mechanisms. Depending on the security requirements of the user, Internet trust mechanisms or mobile-based key exchange mechanisms can be applied. The user-centric approach will enable the user to select an identity provider for the trusted management. A prototype using semantically defined social relationships demonstrates the capabilities of the suggested approach.
Stepping Up to Long-Term Research
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

After many years of budget cuts and limelight lost to other disciplines, long-term computer science research is receiving a new, if tentative, boost. Recent government-sponsored reports have emphasized basic CS research needs and, perhaps more important, a general direction the overall effort might take. Concurrently, the US Congress has begun to demonstrate a willingness to fund some of these projects to an extent sorely lacking for several years.
DESERT: a decentralized monitoring tool generator
Authors: Paola Inverardi, Leonardo Mostarda
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

This paper presents the tool DESERT that allows the generation of decentralized monitoring systems for component based applications.
Optimal control of SARS epidemics based on cybernetics
Authors: C. Jiang
Venue: International Journal of Systems Science (2007)

This paper proposes a concept of the optimization of control measures for SARS epidemics spread, which is based on the subsystem of the compartmental model. The subsystem includes only two variables, exposed class E(t) and infectious class I(t) in free block of a community, but they are the main source of SARS epidemics spread. We proved mathematically that a maximum quarantine/isolation measures for them would reduce SARS epidemics to minimum extent in minimum time according to Pontryagin's minimum principle. Finally, the numerical simulations are given, and the results are satisfied.
Modified Particle Swarm Optimization Algorithm and Its Application on Optimal Operation of Hydropower Station
Authors: Ni Wang, Shaobo Wang, Jiancang Xie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Although Particle Swarm Optimization (PSO) is widely used on solving neural network training, fuzzy system control and function optimization problems as a stochastic optimization technology for its easy use and independent of experience, it has a problem of easy falling into partial optimization. Therefore, a modified PSO algorithm based on parallel-searching mechanism named P-S is introduced in reservoir operation field. An example is also used to show that the P-S algorithm has a better application prospects for its fast operation speed and high reliability in global optimization.
Mutation Testing from Probabilistic Finite State Machines
Authors: Robert M. Hierons, Mercedes G. Merayo
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Mutation testing traditionally involves mutating a program in order to produce a set of mutants and using these mutants in order to either estimate the effectiveness of a test suite or to drive test generation. Recently, however, this approach has been applied to specifications such as those written as finite state machines. This paper extends mutation testing to finite state machine models in which transitions have associated probabilities. The paper describes several ways of mutating a probabilistic finite state machine (PFSM) and shows how test sequences that distinguish between a PFSM and its mutants can be generated. Testing then involves applying each test sequence multiple times, observing the resultant output sequences and using results from statistical sampling theory in order to compare the observed frequency of each output sequence with that expected.
The Quasi-Serial Multiplier
Authors: E. E. Swartzlander
Venue: IEEE Transactions on Computers (1973)

A novel technique for digital multiplication is presented that represents a considerable departure from conventional (i.e., add and shift or fully parallel) multiplication algorithms. The quasi-serial multiplier generates the bits of the product sequentially from least significant to most significant. Each bit is computed by "counting" the number of ones in the corresponding column of the bit-product matrix and adding the previous carrys. This single operation yields both the product bit and the carrys for the next column. The quasi-serial multiplier requires 2n of these count and add operations to determine the product of two n-bit numbers.
Proceedings of the 8th ACM SIGITE conference on Information technology education
Venue: Conference On Information Technology Education (formerly CITC) (2007)

With great pleasure, we welcome you to the 8th ACM SIG-Information Technology Education Conference -- SIGITE 2007. This year's conference continues its tradition of being the premier forum for presentation of research results and classroom experience regarding the pillars of information technology education: programming, networking, web technologies, resource management and human-computer interaction. Our mission is to share novel, practical and generally applicable pedagogical approaches to all topics in IT education, demonstrate effective bridges between academia and industry, and provide an environment conducive to peer discussion, student engagement and institutional cooperation. The call for papers attracted 102 full-paper submissions from all over the world, including Australia, Brazil, Pakistan, Korea and China. The program committee accepted 42 papers and 6 posters that cover a variety of topics, including general IT Education as well as online education issues, IT Curriculum Development in Programming and System Design, and Accreditation issues. Panels include a session devoted to exploring concerns around the involvement of women in IT and IT education, the formalization of an IT research agenda and programming instruction using ALICE, a visual programming approach. We have a very full conference and look forward to your participation. We have an outstanding keynote speaker this year during our plenary session. The keynote speech by Mike Jones, Executive Vice President and Chief Operating Officer of Computer Programs & Systems, Inc. (CPSI). He will highlight the urgent needs of industry relevant to IT education.
Increasing NoC Performance and Utilisation using a Dual Packet Exit Strategy
Authors: Mikael Millberg, Axel Jantsch
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

When designing a network the use of buffers is inevitable. Buffers are used at the entry point, inside and at the exits of the network. The usage of these buffers significantly changes the performance of the system as a whole. In order to enhance the buffer utilisation the concept of letting more than one packet exit the network at every switch each clock cycle is introduced - Dual Packet Exit (DPE). The approach is tried on a 4·4 and a 6·6 mesh. We demonstrate the buffers used in combination with different routing strategies for best effort performance. The result we present shows a 50% reduction in terms of worst case latency and a 30% reduction in terms of average latency as well as an increased throughput both from a system and network perspective. We define the term Operational Efficiency as a measure of the network efficiency and show that it increases by roughly 20% with the DPE technique.