ppxscal/embedding_network huggingface dataset:
Head pose tracking and gesture detection using block motion vectors on mobile devices
Authors: Renxiang Li, Cuneyt Taskiran, Mike Danielsen
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

We present a novel and practical algorithm for head pose tracking and head gesture detection applicable to avatar applications and Human Computer Interaction (HCI) on mobile devices. The algorithm takes advantage of block motion vectors estimated for real-time video encoding on the device. After spatial and temporal smoothing, block motion vectors are mapped into a video pointer signal, which is further mapped into head pose signals for avatar animation control. In contrast to conventional tracking algorithms, our algorithm processes block motion vectors rather than pixel data, leading to drastically reduced computational requirement. This makes it a practical solution for head tracking in real time on high end mobile devices. A simple and reliable way of detecting head nod and shake gestures is also presented, using a deterministic finite state machine.
Novel structure of current amplifier and its application
Authors: Ivo Lattenberg, Kamil Vrba
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

The paper deals with a novel structure of current amplifier and its application in filters working in the so-called pure current mode. It introduces a novel CDCOA element (Current Differencing Current Operational Amplifier). Its bipolar structure is designed. The new element is verified in the universal multifunction filter working in the pure current mode. Because of the better frequency properties of the current mode and because of the dynamic range decreasing in the voltage mode due to decreased supply voltages enabled by present day technology, a universal filter is designed that operates in the pure current mode. It is a circuit where the active elements are only current controlled current sources. The CDCOA elements designed were used as active elements.
The evolution and the future of the e-gov
Authors: Ricardo Campos, Célio Gonçalo Marques
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

After a continuously development in on-line availability, most of the countries are close to reach the highest point of public services maturity. The future of e-Gov should now go through accessibility questions and m-Gov, providing a new set of user-centred services, personalized and based on alerts that could be programmed taking into account knowledge based in the localization of the user. In this article we will analyze the stage of e-Gov in Europe based in a report of the European Commission, which allows, the realization of a comparative analysis of the evolution occurred between 2004 and 2006 in the 28 countries part of the study. Following, we analyze the case of Portugal, pointing out some of the reasons to the success of the measures applied. Finally we project the future of e-Gov in terms of accessibility questions, platform access independence and user-centred services.
Privacy Based Access to Parlay X Location Services
Authors: Nabil Ajam
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

Next Generation Networks (NGN) stipulate an open access of core networks, which were previously closed. Service-oriented architecture (SOA) is a promising way to provide the access to third party providers. So, web services, as the prevalent realisation of SOA, constitute a standard middleware between service providers and cellular networks. However the spread of new innovative services run into the problem of the privacy of personal data. Indeed, service providers will hold more and more sensitive information and users are suspicious for revealing their personal data to unauthorized and unwanted parties. Henceforth, current web service standards lack of a clear solution for providing privacy policy. We suggest that the open access of operator networks to third parties goes with the respect of the privacy policy of users. In this paper, we propose to add to Parlay X gateway a novel Privacy web service, which is responsible for managing and ensuring privacy of users. To validate our solution, we apply it to Location Services (LCS), which is a major capability provided by 2G and 3G cellular networks.
Does knowledge reuse make a creative person more creative?
Authors: Pak-Keung Cheung, Patrick Y. K. Chau, Anson K. K. Au
Venue: Decision Support Systems (2008)

This paper examines the effect of the most common type of organizational knowledge management system, that is, an intranet-based knowledge repository, on the level of creative performance of an individual. An experiment was conducted on more than a hundred individuals to investigate the quantitative and qualitative levels of creativity outcomes on an open-ended business task. Their levels of baseline creativity skills were also measured in order to inspect its interaction with knowledge reuse. The results suggest that knowledge reuse resulting from this repository type of knowledge management system actually inhibits the creative performance of individuals, especially on the qualitative dimension.
Topic and language specific internet search engine
Authors: Domonkos Tikk, György Biró, Ferenc P. Szidarovszky, Zsolt T. Kardkovács, Gábor Lemák
Venue: Acta Cybernetica (2007)

In this paper we present the result of our project that aims to build a categorization-based topic-oriented Internet search engine. Particularly, we focus on the economic related electronic materials available on the Internet in Hungarian. We present our search service that harvests, stores and makes searchable the publicly available contents of the subject domain. The paper describes the search facilities and the structure of the implemented system with special emphasis on intelligent search algorithms and document processing methods.
A Method for Widening the Range of Force Measurement and Gap Adjustment in the Total Knee Replacement
Authors: Jian Wu, Ming Zhao, Datian Ye, Guangzhi Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The artificial knee replacement (TKR) surgery is one of the major surgeries to cure the severe pathological changes in the knee for osteoarthritis. The soft tissue balance is very important to prolong the artificial joint’s life in the TKR, the authors have developed a soft tissue balance measurement system to meet the quantitative soft tissues balance measurement requirement in the TKR. In the system applications, we found that the system can not fully satisfy the range of the soft tissue’s force measurement and gap adjustment. In this paper, we proposed a method to widen the range of the force measurement based on the level principle, and gap adjustment by combining the adjustable mechanical structure with fixed thickness block. And by designing some different shapes of touch plate, the system can measure the soft tissue’s force generated in the different parts round the knee. The preliminary test shows that the measurement system can evidently improve the force measurement range and the gap adjustment range in the knee joint, and largely reducing the designing the difficulty of the mechanical machining.
Cluster-Based FAQ Retrieval Using Latent Term Weights
Authors: Harksoo Kim, Jungyun Seo
Venue: IEEE Intelligent Systems (2008)

To resolve lexical disagreement problems in FAQ retrieval, we propose a high-performance FAQ retrieval system using query-log clustering. The FAQ retrieval system is divided into two subsystems: a query-log clustering system and a cluster-based retrieval system. During indexing, the query-log clustering subsystem classifies the logs of users' queries into predefined FAQ categories using a dimensionality reduction technique called latent semantic analysis. Then, it groups the query logs according to the classification results. During retrieval, the cluster-based retrieval subsystem smoothes the FAQs using the query-log clusters. Then, it calculates the similarities between the users' queries and the smoothed FAQs. Using the cluster-based retrieval technique, the proposed system can partially bridge lexical chasms between users' queries and FAQs. In addition, the proposed system outperforms the traditional information retrieval systems in FAQ retrieval.
Speculative and distributed simulation of many-particle collision systems
Authors: Ruipeng Li, Hai Jiang, Hung-Chi Su, Bin Zhang, Jeff Jenness
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

As problem size increases dramatically and quickly, many scientific computing applications, such as molecular dynamics and many-particle collision simulations, exhibit high demand on data capacity and computability of the hosting computer systems. Scalable solutions are on demand. Neither well optimized sequential algorithms nor expensive shared memory parallel computers could be the ultimate choice for such large-scale problems. This paper intends to solve this scalability problem by taking advantage of the availability of commodity computers. Aggregated memory and networked computers satisfy the capacity and computability requests. To overcome the strong event dependency nature in particle collision simulations, a speculative execution scheme is proposed to exploit parallelism. Performance analysis and experiments are provided to show the balance between scalability and performance gains.
On the strength of Gomory mixed-integer cuts as group cuts
Authors: Sanjeeb Dash, Oktay G&#x00fc;nl&#x00fc;k
Venue: Mathematical Programming: Series A and B (2008)

Gomory mixed-integer (GMI) cuts generated from optimal simplex tableaus are known to be useful in solving mixed-integer programs. Further, it is well-known that GMI cuts can be derived from facets of Gomory&#x2019;s master cyclic group polyhedron and its mixed-integer extension studied by Gomory and Johnson. In this paper we examine why cutting planes derived from other facets of master cyclic group polyhedra (group cuts) do not seem to be as useful when used in conjunction with GMI cuts. For many practical problem instances, we numerically show that once GMI cuts from different rows of the optimal simplex tableau are added to the formulation, all other group cuts from the same tableau rows are satisfied.
Analysis of a transport model applying operator splitting and semi-Lagrangian method
Authors: Petra Csomos
Venue: International Journal of Computational Science and Engineering (2007)

In the present paper, a simple 2D air pollution transport model is investigated applying the sequential and the Strang Marchuk operator splitting procedures. A comparison is done between the cases when the upwind scheme and the semi-Lagrangian scheme are used for solving the advection sub-problem.
A generic model for managing software architecture evolution
Authors: Mourad Oussalah, Nassima Sadou, Dalila Tamzalit
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Evolution becomes an important concern of software architectures, as well at architectural level as at application one. In addition, such evolution can be rather static (at specification time) than dynamic (at execution time). To face this important problem of software-architecture evolution, it is necessary to consider the evolution in a genetic and uniform way by : defining the same concepts to manage the evolution of any architectural elements at any level of abstraction and independently of the software architectures description or implementation language. Our work aims to reach these objectives through the proposed model, called SAEV(Software Architecture EVolution Model). SAEV offers evolution operations described by evolution strategies and evolution rules to manage the architectural elements evolution. These rules and strategies must respect all invariants defined on each architectural element to safeguard the architecture coherence across the evolution. SAEV proposes also an evolution mechanism, which describes the execution process of the evolution model.
Developing natural language-based program analyses and tools to expedite software maintenance
Authors: Emily Hill
Venue: Companion of the 30th international conference on Software engineering (2008)

With as much as 60-90% of software life cycle resources spent on program maintenance, there is a critical need for automated software tools to help explore and understand today's large and complex software. One important source of information software maintenance tools can draw from is lexical information in comments and identifiers. Identifier names often communicate a programmer's intent when writing code, and help developers map real-world concepts to code during comprehension. My dissertation will develop specialized information retrieval techniques and natural language analyses for software so that software maintenance tools can take full advantage of the wealth of information in program identifiers, and integrate these techniques into software tools to expedite the maintenance activities of program exploration, concern location, and fault localization.
Optimizing away joins on data streams
Authors: Lukasz Golab, Theodore Johnson, Nick Koudas, Divesh Srivastava, David Toman
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

Monitoring aggregates on network traffic streams is a compelling application of data stream management systems. Often, streaming aggregation queries involve joining multiple inputs (e.g., client requests and server responses) using temporal join conditions (e.g., within 5 seconds), followed by computation of aggregates (e.g., COUNT) over temporal windows (e.g., every 5 minutes). These types of queries help identify malfunctioning servers (missing responses), malicious clients (bursts of requests during a denial-of-service attack), or improperly configured protocols (short timeout intervals causing many retransmissions). However, while such query expression is natural, its evaluation over massive data streams is inefficient. In this paper, we develop rewriting techniques for streaming aggregation queries that join multiple inputs. Our techniques identify conditions under which expensive joins can be optimized away, while providing error bounds for the results of the rewritten queries. The basis of the optimization is a powerful but decidable theory in which constraints over data streams can be formulated. We show the efficiency and accuracy of our solutions via experimental evaluation on real-life IP network data using the Gigascope stream processing engine.
Estimating PageRank on graph streams
Authors: Atish Das Sarma, Sreenivas Gollapudi, Rina Panigrahy
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

This study focuses on computations on large graphs (e.g., the web-graph) where the edges of the graph are presented as a stream. The objective in the streaming model is to use small amount of memory (preferably sub-linear in the number of nodes n) and a few passes. In the streaming model, we show how to perform several graph computations including estimating the probability distribution after a random walk of length l, mixing time, and the conductance. We estimate the mixing time M of a random walk in Õ(nα+Mα√n+√Mn/ α) space and Õ(√Mα) passes. Furthermore, the relation between mixing time and conductance gives us an estimate for the conductance of the graph. By applying our algorithm for computing probability distribution on the web-graph, we can estimate the PageRank p of any node up to an additive error of √εp in Õ(√M/α) passes and Õ(min(nα + 1/ε √M/α + 1/ε Mα, αn√Mα + 1/ε √M/α)) space, for any α ∈ (0, 1]. In particular, for ε = M/n, by setting α = M--1/2, we can compute the approximate PageRank values in Õ(nM--1/4) space and Õ(M3/4) passes. In comparison, a standard implementation of the PageRank algorithm will take O(n) space and O(M) passes.
Structured Types and Separation Logic
Authors: Harvey Tuch
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Structured types, such as C's arrays and structs, present additional challenges in pointer program verification. The conventional proof abstractions, multiple independent typed heaps and separation logic, which in previous work have been built on a low-level memory model for C and shown to be sound, are not directly applicable in verifications. This is due to the non-monotonic nature of pointer and lvalue validity in the presence of the unary &-operator. For example, type-safe updates through pointers to fields of a struct break the independence of updates across typed heaps or @?^*-conjuncts. In this paper we present a generalisation of our earlier formal memory model that captured the low-level features of C's pointers and memory and formed the basis for an expressive implementation of separation logic, with new features providing explicit support for C's structured types. We implement this framework in the theorem prover Isabelle/HOL and all proofs are machine checked.
Fuzzy mode and its applications in survey research
Authors: Yuan-Horng Lin, Berlin Wu
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The public consensus of evaluations is an important issue in the quantitative research. Most of research tools, like the survey or questionnaire, are to ask people to answer their thinking in binary logic and provide a single answer on some items. They usually adopt statistical computations in traditional approaches to express public consensus. However, this process ignores the fuzzy thinking perceived in human logic and recognition. Fuzzy theory provides the logic of multi-logic which is beyond the limitations of binary logic. Thus, it will be more proper to employ the membership function and fuzzy statistical analysis. In this paper we will provide the definition of fuzzy mode, its proofs and properties. In addition to discussing these characteristics of fuzzy mode, we also apply the fuzzy mode in measuring public consensus with empirical data of educational survey. In the conclusion, suggestions and recommendations for future research and advanced issues are presented.
Breast Tumor Identification in Ultrasound Images Using the Normalized Cuts with Partial Grouping Constraints
Authors: Shao-Yu Chen, Herng-Hua Chang, Shuo-Hui Hung, Woei C. Chu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

Breast cancer is one of the leading causes of death in women. Early detection and treatment plays an important role in decreasing the mortality rate. Ultrasound is increasingly been used as an adjunct to mammography to detect breast tumors. An accurate and reliable tool to assist physicians in making diagnosis and treatment decisions is essential and necessary. We propose the use of the normalized cuts with partial grouping constraints to segment breast tumors in cropped ultrasonic images. The experimental results indicated that the proposed approach was robust in identifying over 500 breast tumors in a wide variety of cancer types. We found that more than 90% of segmented tumors satisfied the clinical demand. We are developing it as an assistant tool to facilitate physicians in identifying breast tumors in ultrasonic images.
Multiple population search strategy for routing selection and sequence optimization of a supply chain
Authors: X. F. Yin, L. P. Khoo
Venue: International Journal of Computer Integrated Manufacturing (2007)

The current paper outlines a framework of a distributed hierarchical model for supply chain planning and scheduling optimization. The framework comprises three main modules: routing and sequence optimization, supply chain virtual clustering and supply chain order scheduling. It is envisaged that the hierarchical model can be used to realize management level strategies, facilitate planning and optimize the detailed operation schedules of various supply chain units in a supply chain. The detailed design of a multiple population search strategy (MPSS) based on genetic algorithm (GA) and tabu search (TS) for routing selection and operation sequence optimization is presented. Using the tabu search, the crossover and mutation rates of GA can be made adaptive to suit different stages of search. The results show that the MPSS is not only able to reach a better solution, but also able to reduce the computational time. The work has also demonstrated the possibility of adopting a hybrid approach that combines the strengths of the tabu search and genetic algorithms for the optimization of routing and sequence in a supply chain in order to achieve management level objectives such as minimizing cost and increasing the level of on-time delivery.
Discrete optimization of steel frame structures
Authors: Stojan Kravanja, Tomaž Žula, Uroš Klanšek
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

The paper presents the discrete optimization of steel frame structures. The optimization is performed by the Mixed-Integer Non-linear Programming optimization approach (MINLP). The MINLP is a combined continuous and discrete optimization technique, where a structural topology and standard sizes are optimized simultaneously with the continuous parameters (e.g. costs, mass). The MINLP optimization is performed through three steps: i.e. the generation of a mechanical superstructure, the modeling of an MINLP model formulation and the solution of the defined MINLP problem. The Modified Outer-Approximation/Equality-Relaxation (OA/ER) algorithm and a two-phase MINLP strategy are applied. The optimization is performed by a user-friendly version of the MINLP computer package MIPSYN. Two examples are presented at the end of the paper.
Autonomic Networking
Authors: John Strassner
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

Next generation networks are being realised by the convergence of wired and wireless converged networks. This has the potential to provide seamless services to the end user, providing freedom of movement between metropolitan/enterprise and indoor/outdoor coverage while maintaining continuity of applications experience. However, this requires significant changes to existing wired and wireless network management systems. These changes balance innovative cognitive networking with a call for the “Calm Technology” of Ubiquitous Computing. The result is an experiential architecture that can learn and reason to provide mechanisms that enable a user to accomplish his or her tasks without regard to device, media, and/or technology. This talk will provide new insight into the challenges of such architectures, and describe a novel autonomic architecture that can dynamically synthesise knowledge about the context of its users, the environment, and the capabilities and constraints placed on the network at any given time in order to dynamically adapt its functionality to that which is required. Several different use cases, including traditional networking as well as cognitive radio, will be examined. This talk will conclude with a summary of the standardisation efforts being undertaken in the Autonomic Communciations Forum, and how these works will provide a solid foundation for interoperability.