ppxscal/embedding_network huggingface dataset:
P2P-based geometric computation method for extracting ROI from ubiquitous video cameras
Authors: Ryo Nishide, Masaaki Ohnishi, Shinji Tsuboi, Shinichi Ueshima
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

This paper proposes a method for extracting the ROI using geometric computations, to obtain information of commonly-interested objects by multiple users. The authors use P2P Delaunay Network to share the regional information shot by cameras with peers, and extract the most intersecting area of camera ranges as ROI. In P2P Delaunay Network, nodes and edges refer to as computers and their connections. This proposed method can construct P2P Delaunay Network using locations of mobile devices as GPS phones or PDAs equipped with a camera, and process computations distributively with these devices. Thereby, a P2P Delaunay network can be constituted, without using the computer resource of other settlements. The method first partitions the plane and assigns the partitions to nodes according to their locations using P2P Delaunay Network. Then, each camera propagates its camera range information to nodes, and each node thus processes computation distributively. The node which has received multiple camera range information computes the intersecting area within its Voronoi region. Finally, the ROI can be determined, by computing the most intersecting area among all nodes. The authors examine the proposed method by evaluating the frequency of region partitioning and data transfer for each node through numerical simulation.
Increasing the Performability of Computer Clusters Using RADIC II
Authors: Guna Santos, Angelo Duarte, Dolores, Emilio Luque
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Performance and availability form an undissociable binomial for some kind of applications. Therefore, the fault tolerant solutions must take into consideration these two constraints when it has been designed. Our previous work, called RADIC, implemented a basic level protection allowing to recover from faults just using the active cluster resources, changing the system configuration. However, Such approach may genenerate some performance degradation in some cases. In this paper, we present RADIC II, which incorporates a new protection level using dynamic redundancy, allowing to mitigate or avoid the recovery side-effects. Such functionality allows restoring a changed system configuration and it can avoid the configuration changes. The results has shown that RADIC-II operates correctly and becomes itself as a good approach to provide high availability to the parallel applications without suffer a system degradation in post-recovery execution.
Characteristic boundary conditions with finite-volume ENO scheme for aeroacoustic simulations
Authors: Yongseok Kim, Yoshiaki Nakamura
Venue: International Journal of Computational Fluid Dynamics (2007)

Characteristic boundary algorithms coupled with high-order modified-flux-approach ENO (essentially non-oscillatory) schemes are proposed in generalized coordinates for the computation of aeroacoustic problems. So far most of the characteristic algorithms have been used along with high-order finite difference schemes. Here in this study finite volume MFA-ENO schemes with characteristic boundary conditions are proposed, and examined to validate the accuracy by applying to several test problems, including the problem of acoustic waves scattered by a circular cylinder and the problem of vortex convection through the outlet boundary. Non-reflecting boundary conditions to prevent acoustic and vorticity waves to be reflected at the boundary are also analysed.
EASY: Efficient semAntic Service discoverY in pervasive computing environments with QoS and context support
Authors: Sonia Ben Mokhtar, Davy Preuveneers, Nikolaos Georgantas, Valérie Issarny, Yolande Berbers
Venue: Journal of Systems and Software (2008)

Pervasive computing environments are populated with networked software and hardware resources providing various functionalities that are abstracted, thanks to the Service Oriented Architecture paradigm, as services. Within these environments, service discovery enabled by service discovery protocols (SDPs) is a critical functionality for establishing ad hoc associations between service providers and service requesters. Furthermore, the dynamics, the openness and the user-centric vision aimed at by the pervasive computing paradigm call for solutions that enable rich, semantic, context- and QoS-aware service discovery. Although the semantic Web paradigm envisions to achieve such support, current solutions are hardly deployable in the pervasive environment due to the costly underlying semantic reasoning with ontologies. In this article, we present EASY to support efficient, semantic, context- and QoS-aware service discovery on top of existing SDPs. EASY provides EASY-L, a language for semantic specification of functional and non-functional service properties, as well as EASY-M, a corresponding set of conformance relations. Furthermore, EASY provides solutions to efficiently assess conformance between service capabilities. These solutions are based on an efficient encoding technique, as well as on an efficient organization of service repositories (caches), which enables both fast service advertising and discovery. Experimental results show that the deployment of EASY on top of an existing SDP, namely Ariadne, enhancing it only with slight changes to EASY-Ariadne, enables rich semantic, context- and QoS-aware service discovery, which furthermore performs better than the classical, rigid, syntactic matching, and improves the scalability of Ariadne.
Between ontology and folksonomy: a study of collaborative and implicit ontology evolution
Authors: Jiahui Liu, Daniel M. Gruen
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present our first user study of CRAFT, a semantic prototype for collaborative investigation and analysis, which allows users to extend the system's ontology to capture new concepts as they conduct their work. We devised a paradigm in which multiple series of ontologies evolve in different trajectories from the same initial point. We analyze the ontology evolution quantitatively with several metrics, and user behavior qualitatively through interviews and observation. Based on our study, we propose a set of design suggestions for semantic applications with collaborative and implicit ontology development.
Algebrization: a new barrier in complexity theory
Authors: Scott Aaronson, Avi Wigderson
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Any proof of P!=NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does not have linear-size circuits) that overcome both barriers simultaneously. So the question arises of whether there is a third barrier to progress on the central questions in complexity theory. In this paper we present such a barrier, which we call algebraic relativization or algebrization. The idea is that, when we relativize some complexity class inclusion, we should give the simulating machine access not only to an oracle A, but also to a low-degree extension of A over a finite field or ring. We systematically go through basic results and open problems in complexity theory to delineate the power of the new algebrization barrier. First, we show that all known non-relativizing results based on arithmetization -- both inclusions such as IP=PSPACE and MIP=NEXP, and separations such as MAEXP not in P/poly -- do indeed algebrize. Second, we show that almost all of the major open problems -- including P versus NP, P versus RP, and NEXP versus P/poly -- will require non-algebrizing techniques. In some cases algebrization seems to explain exactly why progress stopped where it did: for example, why we have superlinear circuit lower bounds for PromiseMA but not for NP. Our second set of results follows from lower bounds in a new model of algebraic query complexity, which we introduce in this paper and which is interesting in its own right. Some of our lower bounds use direct combinatorial and algebraic arguments, while others stem from a surprising connection between our model and communication complexity. Using this connection, we are also able to give an MA-protocol for the Inner Product function with O(sqrt(n) log n) communication (essentially matching a lower bound of Klauck).
Cost-Effective Joint Echo-NEXT Canceller Designs for 10GBase-T Ethernet Systems Based on a Shortened Impulse Response Filter (SIRF) Scheme
Authors: Yen-Liang Chen, Ming-Feng Hsu, Jyh-Ting (Justin) Lai, An-Yeu (Andy) Wu
Venue: Journal of Signal Processing Systems (2008)

Echo canceller plays an important role in the full-duplex communication system. Conventional implementations of echo cancellers are often the adaptive transversal filter architectures due to the simplicity and robustness of stability and convergence. However, the conventional echo cancellers suffer from high cost problem especially when the response time of the echo is long. In this paper, a new cost-efficient architecture of echo cancellers, targeting on 10GBase-T Ethernet System, is presented. The proposed scheme inherits the concept of channel shortening which is widely employed in DSL systems. A shortened impulse response filter is implemented at the receiver to shorten the impulse response of the echo signal. Hence, the overall cost of echo cancellers can be reduced. We generalize the channel shortening architecture to a joint multi-channel shortening scheme. The joint multi-channel shortening architecture can be applied to multiple-input multiple-output wireline communication systems to further reduce both the cost of echo and near-end crosstalk (NEXT) cancellers. We apply the proposed scheme to 10GBase-T Ethernet system. The simulation results show that the proposed echo and NEXT cancellers can save up to 35% hardware cost compared to the conventional transversal implementations.
Proceedings of the 1st international workshop on Software architectures and mobility
Venue: International Conference on Software Engineering (2008)

It is our great pleasure to welcome you to the First International Workshop on Software Architectures and Mobility (SAM 2008). The theme of this year ICSE is Driving World Business, acknowledging the crucial role the engineering of software plays in a variety of sectors, from business to health care, from telecommunications to embedded systems. Mobility stands out as an orthogonal dimension to most of these application domains: consider, for example, the outburst of m-commerce applications, or the use of pervasive computing technologies to deliver healthcare services in the future. The goal of this workshop is to strengthen the cross-fertilization of advances from requirements and domain engineering, software architectures, and middleware to systematically develop and evolve architectures supporting mobility. SAM gives software engineering researchers and practitioners a unique opportunity to facilitate information exchange, share ideas, and promote collaboration. The call for papers attracted both full and short papers from researchers in Asia, Canada, Europe and the United States. The program committee conducted a rigorous reviewing process, at the end of which 6 full papers and 6 short papers were accepted for presentation and discussion at the workshop. In addition, the program includes a keynote speech by Nenad Medvidović, from the University of Southern California. We hope that these proceedings will serve as a valuable reference for researchers and developers in the field of software architectures and mobility from institutions around the world.
Simulation-based verification using Temporally Attributed Boolean Logic
Authors: S. K. Panda, Arnab Roy, P. P. Chakrabarti, Rajeev Kumar
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

We propose a specification logic called Temporally Attributed Boolean (TAB) Logic for Assertion Based Verification, which allows us to: (i) represent assertions succinctly, (ii) incorporate data-orientation and (iii) associate timing to design intentions. TAB Logic allows us to write specifications functionally linking system variables from different temporal contexts. We present examples to show the motivation for this logic especially in the context of high level modeling of complex real time systems. We formally define TAB Logic, formulate the problem of verification on a simulation trace and present efficient algorithms to check TAB assertions, both offline and online. We present results of application of TAB Logic for Instruction Semantics and Bus Transaction Verification of a bus integrated pipelined processor core implementation. We also employ TAB Logic to validate the Interrupt mode behavior of the processor core implementation. Further, we show the utility of TAB Logic in fault detection. Finally, we demonstrate the applicability of TAB Logic in the domain of simulation based verification of analog circuits like Operational Amplifiers and DC-DC Converters. We finally discuss the limitations of TAB logic and conclude.
Analysing and enhancing business processes and IT-systems for mobile workforce automation: a framework approach
Authors: Volker Gruhn, André Köhler
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Mobile B2E-applications (business-to-employee) can add significant value to a company's business, when large workforce divisions are involved in the execution of certain business processes. From a technical point of view, the major issues are solved (e.g. solutions for connectivity, broadband mobile networks, synchronization mechanisms, secure protocols etc.). But from a business point of view there is a lack of methodology regarding the alignment of technical solutions to the business needs. As companies face a continuously faster change in business models, legal constraints and customer needs, highly flexible systems are needed to react to changing business processes. Furthemore, the introduction of new mobile systems is often a technology-driven process, pushing the alignment of software and systems to the highly specific, fast changing business needs into the background. This paper introduces a framework summarizing the findings from earlier research and case studies related to this topic. The framework consists of a general reference process for mobile work and of a model explaining influencing factors, optimization goals and their relationships for mobile processes. The framework can be applied for process modeling, simulation and optimization as well as for requirements analysis and return on investment calculations.
Custom is from Venus and synthesis from Mars
Authors: Ruchir Puri, William H Joyner, Shekhar Borkar, Ty Garibay, Jonathan Lotz, Robert Montoye
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Due to ever increasing cost of doing design, design productivity and more specifically, cost of design has become a major bottleneck in large scale design projects. Due to the cost crunch, automated synthesis techniques have been gaining ground on manual and cost intensive (although potentially yielding higher quality of results) custom techniques. The push towards system level performance with multiple lower performance cores as opposed to single high performance core is also making the pursuit of frequency at any cost meaningless. Synthesis vs Custom has traditionally been a lively debate in microprocessor companies but now it is becoming more widespread with the desire of fabless companies to more fully utilize the technology node in order to compete with IDMs by utilizing more custom techniques. Custom hotshots argue that we cannot afford to leave performance or power on table when you are spending 3billion $s in fabs. Industry needs to get maximum benefits possible. Synthesis fanatics will argue that designers should get over the last few ps and last few nW, as time to market, cost, and system performance are the new drivers and synthesis can not only meet the challenge but beat it many times with lower power solutions. This panel will present this internal debate in a public forum.
Comparison of the asymptotic stability properties for two multirate strategies
Authors: V. Savcenco
Venue: Journal of Computational and Applied Mathematics (2008)

This paper contains a comparison of the asymptotic stability properties for two multirate strategies. For each strategy, the asymptotic stability regions are presented for a 2x2 test problem and the differences between the results are discussed. The considered multirate schemes use Rosenbrock type methods as the main time integration method and have one level of temporal local refinement. Some remarks on the relevance of the results for 2x2 test problems are presented.
Rough Set Based Information Retrieval from Argumentative Data Points in Weblogs
Authors: Sea Woo Kim, Chin-Wan Chung
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

This paper describes a decision tree model and 3-dimensional representation of information retrieved from various weblogs in relation to argumentative logics. The weblogs are considered as datasets that show significant correlations between the queries applied to them. We have extracted a compact set of rules to support the dataset with the queries and employed effective evaluation metrics to evaluate the weighted average of the weblogs categorized into different types. The opinions from the weblogs are retrieved and represented as an object oriented 3-Dimensional system. The goal of our approach is to generate rules from rough sets and to represent them in a 3-dimensional interactive program, Blog Cosmos. We used rough set theory as a candidate framework for query refinement. Keywords: Information search and retrieval, Information filtering, Rough sets, Decision model.
Retrieval models for question and answer archives
Authors: Xiaobing Xue, Jiwoon Jeon, W. Bruce Croft
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Retrieval in a question and answer archive involves finding good answers for a user's question. In contrast to typical document retrieval, a retrieval model for this task can exploit question similarity as well as ranking the associated answers. In this paper, we propose a retrieval model that combines a translation-based language model for the question part with a query likelihood approach for the answer part. The proposed model incorporates word-to-word translation probabilities learned through exploiting different sources of information. Experiments show that the proposed translation based language model for the question part outperforms baseline methods significantly. By combining with the query likelihood language model for the answer part, substantial additional effectiveness improvements are obtained.
Improving maximum margin matrix factorization
Authors: Markus Weimer, Alexandros Karatzoglou, Alex Smola
Venue: Machine Learning (2008)

Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful learning approach to this task and has been recently extended to structured ranking losses. In this paper we discuss a number of extensions to MMMF by introducing offset terms, item dependent regularization and a graph kernel on the recommender graph. We show equivalence between graph kernels and the recent MMMF extensions by Mnih and Salakhutdinov (Advances in Neural Information Processing Systems 20, 2008). Experimental evaluation of the introduced extensions show improved performance over the original MMMF formulation.
Linear-Time Computation of Similarity Measures for Sequential Data
Authors: Konrad Rieck, Pavel Laskov
Venue: The Journal of Machine Learning Research (2008)

Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of similarity measures for sequences, covering various kernel, distance and non-metric similarity functions. The basis for comparison is embedding of sequences using a formal language, such as a set of natural words, k-grams or all contiguous subsequences. As realizations of the framework we provide linear-time algorithms of different complexity and capabilities using sorted arrays, tries and suffix trees as underlying data structures. Experiments on data sets from bioinformatics, text processing and computer security illustrate the efficiency of the proposed algorithms---enabling peak performances of up to 106 pairwise comparisons per second. The utility of distances and non-metric similarity measures for sequences as alternatives to string kernels is demonstrated in applications of text categorization, network intrusion detection and transcription site recognition in DNA.
A taxonomy of task types in computing
Authors: Matt Bower
Venue: Proceedings of the 13th annual conference on Innovation and technology in computer science education (2008)

Based on the systematic development of a curriculum for our undergraduate computer science units, an analysis of general education and CSE literature and consultation with other computer science educators, a taxonomy of task types in computing is proposed. These task types are related to one another in a hierarchical fashion based on their cognitive interdependencies. The taxonomy can be applied by academics to guide the development of curriculum that meets student process based learning needs rather than just content needs, the latter being the current norm.
On Group Connectivity of Graphs
Authors: Hong-Jian Lai, Rui Xu, Ju Zhou
Venue: Graphs and Combinatorics (2008)

Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero Z 3-flow and Jaeger et al. [Group connectivity of graphs&#x2013;a nonhomogeneous analogue of nowhere-zero flow properties, J. Combin. Theory Ser. B 56 (1992) 165-182] further conjectured that every 5-edge-connected graph is Z 3-connected. These two conjectures are in general open and few results are known so far. A weaker version of Tutte&#x2019;s conjecture states that every 4-edge-connected graph with each edge contained in a circuit of length at most 3 admits a nowhere-zero Z 3-flow. Devos proposed a stronger version problem by asking if every such graph is Z 3-connected. In this paper, we first answer this later question in negative and get an infinite family of such graphs which are not Z 3-connected. Moreover, motivated by these graphs, we prove that every 6-edge-connected graph whose edge set is an edge disjoint union of circuits of length at most 3 is Z 3-connected. It is a partial result to Jaeger&#x2019;s Z 3-connectivity conjecture.