ppxscal/embedding_network huggingface dataset:
A Context-aware System Architecture using Personal Information based on Ontology
Authors: Hyun-suk Hwang, Seong-hyun Shin, Ki-uk Kim, Seok-Cheol Lee, Chang-soo Kim
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Context-aware applications can satisfy users' information needs without consuming too much time in discovering information adaptive to users. In this paper, we propose a personalized information system to provide more user-oriented information considering context information such as a personal profile with preferences, location, traffic condition, weather, time, event, and so on. Our system architecture is designed to support an effective execution usage on Web services and client applications. We implement a map viewer using a shape type of map format files with Points of Interest(PoI) information. Also, our system can provide associated search results from relations between the objects using context ontologies modeling created by the categorized layers of geospatial data.
Faulty-Tolerant Computing: An Overview
Authors: A. Avizienis
Venue: Computer (1971)

The discipline of fault-tolerant computing would be unnecessary if computer hardware and programs would always behave in perfect agreement with the designer's or programmer's intentions. However, imperfections of computer systems and program "bugs" have been with us since the first computer was built, and fault tolerance will remain an important objective as long as computers are in demand.
Link analysis for Web spam detection
Authors: Luca Becchetti, Carlos Castillo, Debora Donato, Ricardo Baeza-YATES, Stefano Leonardi
Venue: ACM Transactions on the Web (TWEB) (2008)

We propose link-based techniques for automatic detection of Web spam, a term referring to pages which use deceptive techniques to obtain undeservedly high scores in search engines. The use of Web spam is widespread and difficult to solve, mostly due to the large size of the Web which means that, in practice, many algorithms are infeasible. We perform a statistical analysis of a large collection of Web pages. In particular, we compute statistics of the links in the vicinity of every Web page applying rank propagation and probabilistic counting over the entire Web graph in a scalable way. These statistical features are used to build Web spam classifiers which only consider the link structure of the Web, regardless of page contents. We then present a study of the performance of each of the classifiers alone, as well as their combined performance, by testing them over a large collection of Web link spam. After tenfold cross-validation, our best classifiers have a performance comparable to that of state-of-the-art spam classifiers that use content attributes, but are orthogonal to content-based methods.
Deterministic Scheduling with Pipelined Processors
Authors: J. Bruno
Venue: IEEE Transactions on Computers (1980)

In this paper several results are proven showing a correspondence between problems involving task systems with single-stage processors and similar ones using pipelined processors. For example, an optimal schedule for a task system with arbitrary precedence constraints using a single pipelined processor with two stages is found by the familiar Coffman-Graham algorithm for a system with two single-stage processors. Precedence constraints in the form of inforests, out-forests, and directed acyclic graphs are examined. Task systems with release times and deadlines for each task are also considered.
A Formal Testing Framework for UML Statecharts
Authors: Xuede Zhan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

This paper introduces a method of formalizing syntax and semantics of UML statecharts with Z. According to this precise semantics, UML statecharts are transformed into FREE (Flattened Regular Expression) state models. Proper testing pre-orders and equivalences are introduced which allow to equate/distinguish systems on the basis of their interaction with the surrounding environment, abstracting from their internal structure. The formal testing framework for UML Statecharts is express with Z.
Automating the detection of snapshot isolation anomalies
Authors: Sudhir Jorwekar, Alan Fekete, Krithi Ramamritham, S. Sudarshan
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Snapshot isolation (SI) provides significantly improved concurrency over 2PL, allowing reads to be non-blocking. Unfortunately, it can also lead to non-serializable executions in general. Despite this, it is widely used, supported in many commercial databases, and is in fact the highest available level of consistency in Oracle and Post-greSQL. Sufficient conditions for detecting whether SI anomalies could occur in a given set of transactions were presented recently, and extended to necessary conditions for transactions without predicate reads. In this paper we address several issues in extending the earlier theory to practical detection/correction of anomalies. We first show how to mechanically find a set of programs which is large enough so that we ensure that all executions will be free of SI anomalies, by modifying these programs appropriately. We then address the problem of false positives, i.e., transaction programs wrongly identified as possibly leading to anomalies, and present techniques that can significantly reduce such false positives. Unlike earlier work, our techniques are designed to be automated, rather than manually carried out. We describe a tool which we are developing to carry out this task. The tool operates on descriptions of the programs either taken from the application code itself, or taken from SQL query traces. It can be used with any database system. We have used our tool on two real world applications in production use at IIT Bombay, and detected several anomalies, some of which have caused real world problems. We believe such a tool will be invaluable for ensuring safe execution of the large number of applications which are already running under SI.
Effect of the contention window size on performance and fairness of the IEEE 802.11 standard
Authors: Azade Khalaj, Nasser Yazdani, Maseud Rahgozar
Venue: Wireless Personal Communications: An International Journal (2007)

IEEE 802.11 is a widely used standard for MAC and PHY layers of WLANs. Unfortunately, the access methods offered in this standard cannot support QoS (Quality of Service) for real-time traffics. Using multimedia applications over WLANs is increasing and, on the other hand, it seems that the access methods employed in this standard causes high variations in delay or jitter and wastes bandwidth due to collisions. There are many methods to enable DCF--basic access method in 802.11--with service differentiation and QoS. The difficulty in majority of these methods is unfair bandwidth allocation among low and high priority traffics at high loads resulting starvation for low priority traffics. In this paper, we modify the way that the CW (Contention Window) size is calculated after a successful transmission and study the effect of the CW size on performance and fairness. Results of our simulations show that the performance of DCF with this modification is better, specially, for traffics in which throughput is the most important parameter. Besides, this method provides better fairness among low and high priority traffics. We also employ a scheme to enable 802.11 with service differentiation which grants dynamic priority to low priority traffics to prevent starvation, specially, in high loads.
Industry Begins to Use Visual Pattern Recognition
Authors: W. Myers
Venue: Computer (1980)

These systems for automatic product handling and inspection have proven themselves successful continued development of low-cost pattern recognition hardware promises many more such systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
RAMP: Research Accelerator for Multiple Processors
Authors: John Wawrzynek, David Patterson, Mark Oskin, Shih-Lien Lu, Christoforos Kozyrakis, James C. Hoe, Derek Chiou, Krste Asanovic
Venue: IEEE Micro (2007)

The RAMP project's goal is to enable the intensive, multidisciplinary innovation that the computing industry will need to tackle the problems of parallel processing. RAMP itself is an open-source, community-developed, FPGA-based emulator of parallel architectures. Its design framework lets a large, collaborative community develop and contribute reusable, composable design modules. Three complete designs--for transactional memory, distributed systems, and distributed-shared memory--demonstrate the platform's potential.
A normal form which preserves tautologies and contradictions in a class of fuzzy logics
Authors: Benjamín Callejas Bedregal
Venue: Journal of Algorithms (2007)

Most of the normal forms for fuzzy logics are versions of conjunctive and disjunctive classical normal forms. Unfortunately, they do not always preserve tautologies and contradictions which is important, for example, for automated theorem provers based on refutation methods. De Morgan implicative systems are triples like the De Morgan systems, which consider fuzzy implications instead of t-conorms. These systems can be used to evaluate the formulas of a propositional language based on the logical connectives of negation, conjunction and implication. Therefore, they determine different fuzzy logics, called implicative De Morgan fuzzy logics. In this paper, we will introduce a normal form for implicative De Morgan systems and we will show that for implicative De Morgan fuzzy logics whose t-norms are strict, this normal form preserves contradictions as well as tautologies.
A general framework for modeling and processing optimization queries
Authors: Michael Gibas, Ning Zheng, Hakan Ferhatosmanoglu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

An optimization query asks for one or more data objects that maximize or minimize some function over the data set. We propose a general class of queries, model-based optimization queries, in which a generic model is used to define a wide variety of queries involving an optimization objective function and/or a set of constraints on the attributes. This model can be used to define optimization of linear and nonlinear expressions over object attributes as well as many existing query types studied in database research literature. A significant and important subset of this general model relevant to real-world applications include queries where the optimization function and constraints are convex. We cast such queries as members of the convex optimization (CP) model and provide a unified query processing framework for CP queries that I/O optimally accesses data and space partitioning index structures without changing the underlying structures. We perform experiments to show the generality of the technique and where possible, compare to techniques developed for specialized optimization queries. We find that we achieve nearly identical performance to the limited optimization query types with optimal solutions, while providing generic modeling and processing for a much broader class of queries, and while effectively handling problem constraints.
Interactive control of real-time crowd navigation in virtual environment
Authors: Xiaogang Jin, Charlie C. L. Wang, Shengsheng Huang, Jiayi Xu
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Interactive control is one of the key issues when simulating crowd navigation in virtual environment. In this paper, we propose a simple but practical method for authoring crowd scenes in an effective and intuitive way. Radial Basis Functions (RBF) based vector field is employed as the governing tool to drive the motion flow. With this basic mathematical tool, users can easily control the motions of crowd by simply sketching velocities on a few points in the scene. Our approach is fast enough to allow on-the-fly modification of the vector field. Besides, the behavior of an individual in a crowd can be interactively adjusted by changing the ratio between its autonomous and governed movements.
The implementation of cuvoicebrowser, a voice web navigation tool for the disabled Thais
Authors: Proadpran Punyabukkana, Jirasak Chirathivat, Chanin Chanma, Juthasit Maekwongtrakarn, Atiwong Suchato
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Surfing the web is, today, a daily activity for most. While we utilize the web as a means of publishing information to the world and accessing information from wherever, less fortunate people do not have that privilege and this includes the blind and the motor-handicapped. This paper explains how we have designed and built the CUVoiceBrowser, a web browser that can be controlled by voice in the Thai language to serve the Thai disabled group. While many have worked on text-to-speech capabilities in reading web pages to the blind, we focus on taking commands from the blinds and the motor-handicapped, in Thai, to navigate the web and to search for information on the web. Our prototype shows high accuracy rate of over 80% when users speak their web navigation commands, and over 70% when Thai characters are inputted by voice.
Scalable parallelization of FLAME code via the workqueuing model
Authors: Field G. Van Zee, Paolo Bientinesi, Tze Meng Low, Robert A. van de Geijn
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We discuss the OpenMP parallelization of linear algebra algorithms that are coded using the Formal Linear Algebra Methods Environment (FLAME) API. This API expresses algorithms at a higher level of abstraction, avoids the use loop and array indices, and represents these algorithms as they are formally derived and presented. We report on two implementations of the workqueuing model, neither of which requires the use of explicit indices to specify parallelism. The first implementation uses the experimental taskq pragma, which may influence the adoption of a similar construct into OpenMP 3.0. The second workqueuing implementation is domain-specific to FLAME but allows us to illustrate the benefits of sorting tasks according to their computational cost prior to parallel execution. In addition, we discuss how scalable parallelization of dense linear algebra algorithms via OpenMP will require a two-dimensional partitioning of operands much like a 2D data distribution is needed on distributed memory architectures. We illustrate the issues and solutions by discussing the parallelization of the symmetric rank-k update and report impressive performance on an SGI system with 14 Itanium2 processors.
A Study for a New IT Service Information Protection Framework
Authors: Jun Heo, Jong Whoi Shin, Ho Sung Kim, Dong Hoon Shin, Gang Shin Lee, Jae Il Lee
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

At present, interest in the new IT services (Wibro, DMB, VoIP, IPTV, etc) is on the rise, and the government is promoting the IT839 Strategy. Any service provider who wants to provide a new IT service needs to secure appropriate security measures based on a threat and vulnerability analysis from the service planning stage. In addition, the need to prepare countermeasures against the possibility of quality deterioration due to the application of security measures has frequently been pointed out. However, it is difficult to use the existing methodologies to perform a threat and vulnerability analysis that enables the application of the security technology without sacrificing quality (when applied at the planning stage for a new IT service), as these methodologies are only suitable for the information assets of an organization that has already been established. This paper proposes an information security framework capable of identifying security threats at the new IT service planning stage, and of easily identifying the relevance between the security technologies and QoS, so that the security technology can be applied while maintaining the quality of the service.
Temporal coding of time-varying stimuli
Authors: Maoz Shamir, Kamal Sen, H. Steven Colburn
Venue: Neural Computation (2007)

Temporal structure is an inherent property of various sensory inputs and motor outputs of the brain. For example, auditory stimuli are defined by the sound waveform. Temporal structure is also an important feature of certain visual stimuli, for example, the image on the retina of a fly during flight. In many cases, this temporal structure of the stimulus is being represented by a time-dependent neuronal activity that is locked to certain features of the stimulus. Here, we study the information capacity of the temporal code. In particular we are interested in the following questions. First, how does the information content of the code depend on the observation time of the cell's response, and what is the effect of temporal noise correlations on this information capacity? Second, what is the effect on the information content of reading the code with a finite temporal resolution for the neural response? We address these questions in the framework of a statistical model for the neuronal temporal response to a time-varying stimulus in a two-alternative forced-choice paradigm. We show that information content of the temporal response scales linearly with the overall time of the response, even in the presence of temporal noise correlations. More precisely, we find that positive temporal noise correlations have a scaling effect that decreases the information content. Nevertheless, the information content of the response continues to scale linearly with the observation time. We further show that finite temporal resolution is sufficient for obtaining most of the information from the cell's response. This finite timescale is related to the response properties of the cell.
Performance Modeling of a Quorum Pattern in Layered Service Systems
Authors: Tariq Omari, Salem Derisavi, Greg Franks, Murray Woodside
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Quorum consensus protocols execute requests in parallel and proceed once K out of N responses are received. The performance of a system depends on the value of K, the dis- tributions of the quorum response delays, and on the use of system resources by the N concurrent requests. An analytic approximation is given for the delay to achieve the quorum, which also accounts for the contention and delay caused by the (N - K) delayed responses. Compared to simula- tion results, our approximation gives reasonable accuracy; about 5% in most cases. Our method is shown to be rapid and scalable.
Costs and benefits of XBRL adoption: early evidence
Authors: Robert Pinsker, Shaomin Li
Venue: Communications of the ACM (2008)

Financial reporting via XBRL is a low-cost method for increasing transparency and compliance while potentially decreasing a firm's cost of capital.
From the Newsstand
Authors: Alison Skratt
Venue: IEEE Internet Computing (2007)

A round-up of Internet-related stories in the IEEE Computer Society and trade press.
Patterns in Security Enforcement Policy Development
Authors: Dan Thomsen
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Creating security enforcement policies is a complex design problem that is often done using a native GUI. A security policy for an enterprise must span native applications and be expressed in a format that best captures design problems. This paper looks at the patterns that emerge when developing enterprising spanning security policy using a language based approach.
Multicast/broadcast network convergence in next generation mobile networks
Authors: Justino Santos, Diogo Gomes, Susana Sargento, Rui L. Aguiar, Nigel Baker, Madiha Zafar, Ahsan Ikram
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The 3GPP Multimedia Broadcast Multicast Service (MBMS) aims to introduce group communications into the 3G networks. One of the current key challenges is how to evolve these incipient features towards the ''beyond 3G vision'' of a converged global network where multimedia content can be delivered over one or more selected broadcast transport bearers. This paper presents potential multicast/broadcast technologies convergence and discusses the issues and challenges in moving towards this next generation network vision from the viewpoint of evolving MBMS.
Constructing a Cluster-Based M-Learning Architecture in Mobile Ad Hoc Networks Using MPEG-21
Authors: Hua-Yi Lin, Zhi-Ren Qiu, De-Jun Pan, Xin-Xiang Zha
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Nowadays, owing to the convenience of mobile devices in our surroundings such as the PDA (Personal Digital Assistant), cell phones, and laptops, there is a tendency toward m-learning (mobile learning) in anywhere. However, m-learning has many constraints including the computing power of mobile devices, network quality of services, and suitable learning tools. Especially, how to provide an effective and convenient platform on different mobile devices is a troublesome problem. In this paper, we propose a cluster-based m-learning architecture to achieve dynamic learning groups, and exploit MPEG-21 methods to carry out the goal.
The expected convex hull trimmed regions of a sample
Authors: Ignacio Cascos
Venue: Computational Statistics (2007)

Given a data set in the multivariate Euclidean space, we study regions of central points built by averaging all their subsets with a fixed number of elements. The averaging of these sets is performed by appropriately scaling the Minkowski or elementwise summation of their convex hulls. The volume of such central regions is proposed as a multivariate scatter estimate and a circular sequence algorithm to compute the central regions of a bivariate data set is described.
Approach of Text Search Based on Semantic Parsing Model
Authors: XiangFeng Wei, Quan Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Keyword-based search is one of the most important technologies of text search. But with the development of World Wide Web, it is not enough only relying on matching the form of keywords. This paper introduced a semantic parsing model constructed above a symbolic system of concepts for understanding natural language. Based on the model a sentence can be mapped into the corresponding semantic category. An approach named `Hypothesis Testing' was used to analyze a sentence according to the conceptual knowledge base and rules. All rules were formalized and executed in computer program. There is also a semantic model for analyzing text. Therefore, both sentence and text can be mapped into semantic structures. A text search prototype based on the semantic model represented more accurate result by comparing the conceptual structures between search condition and text.