ppxscal/embedding_network huggingface dataset:
An Event-driven Navigation Platform forWearable Computing Environments
Authors: Masakazu Miyamae, Tsutomu Terada, Masahiko Tsukamoto
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

Wearable computing environments are slowly becoming a reality, worn and used by a user wherever he or she goes. As a result, a lot of attention is given to navigation systems that provide various information according to the users' situation. In this paper, we identify the requirements of wearable navigation systems and propose an event-driven navigation platform to fulfill them. Since the behaviors of our platform are described in a set of event-driven rules, users can adopt a variety of attached devices and customize system configurations. Moreover, we have developed a prototype and made an experimental study for its evaluation. Using our system, service providers can easily construct flexible wearable navigations.
Managing information access through documentation of the data base: characterizing social science data base text documentation as a minimal information management system
Authors: Alice Robbin
Venue: ACM SIGSOC Bulletin (1974)

If data are to be accessed, text documentation must adequately describe the processes of data collection, development, testing and evaluation of the file in order that analysis of the data file can be adequately performed. Text documentation can be conceptualized as a minimal information system with the functions of providing a conceptual framework for the collection process, communication and coordination of processing staff, historical reference, general instruction for communication between specialist and non-specialist, and a report on successful output. Text documentation has three components: source, codebook and technical. This discussion focuses only on the components of source and codebook documentation.
MegaProto: 1 TFlops/10kW Rack Is Feasible Even with Only Commodity Technology
Authors: Hiroshi Nakashima, Hiroshi Nakamura, Mitsuhisa Sato, Taisuke Boku, Satoshi Matsuoka, Daisuke Takahashi, Yoshihiko Hotta
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In our research project "Mega-Scale Computing Based on Low-Power Technology and Workload Modeling", we claim that a million-scale parallel system could be built with densely mounted low-power commodity processors. "MegaProto" is a proof-of-concept low-power and highperformance cluster build only with commodity components to implement this claim. A one-rack system is composed of 32 motherboard "cluster units" of 1 U-height and commodity switches to interconnect them mutually as well as with other racks. Each cluster unit houses 16 low-power dollarbill- sized commodity PC-architecture daughterboards, together with a high bandwidth, 2 Gbps per processor embedded switched network based on Gigabit Ethernet. The peak performance of a one-rack system is 0.48 TFlops for the first version and will improve to 1.02 TFlops in the second version through a processor/daughterboard upgrade. The system consumes about 10 kW or less per rack, resulting in 100 MFlops/W power efficiency with a power-aware intrarack network of 32 Gbps bisection bandwidth, while additional 2.4 kW will boost this to sufficiently large 256 Gbps. Performance studies show that even the first version significantly outperforms a conventional high-end 1U server comprised of dual power-hungry processors in a majority of NPB programs. It is also investigated how the current automated DVS control could save power for the HPC parallel programs along with its limitation.
Utilize Fuzzy Data Mining to Find the Travel Pattern of Browsers
Authors: Qingzhan Chen, Han Jianghong, Wenxiu He, Yungang Lai
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

With the traveling records of browsers, one can analyze the preference of pages, further understand the demands of consumers, and promote the advertising and marketing. In this study, we use Maximum Forward Reference (MFR) algorithm to find the travel pattern of browsers from web logs. Simultaneously, experts are asked to evaluate the fuzzy importance weightings for different webs. At last, we employ fuzzy data mining technique that combines Apriori algorithm with fuzzy weights to determine the association rules. From the yielded association rules, one can be accurately aware of the information consumers need and which webs they prefer. This is important to governmental institutions and enterprises. Enterprises can find the commercial opportunities and improve the design of webs by means of this study. Governmental institutions can realize the needs of people from the obtained association rules, make the promotion of policy more efficiently, and provide better service quality.
A Novel Transition Fault ATPG That Reduces Yield Loss
Authors: Xiao Liu, Michael S. Hsiao
Venue: IEEE Design Test (2005)

Transition delay tests are crucial to finding ICs with timing defects, but they can also find functionally untestable timing-related faults, thus reducing yield. This article describes an ATPG with constraints that prevent it from using the illegal states that lead to this overtesting.
From relevance to intelligence: toward next generation web search
Authors: Wei-Ying Ma
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

Today search engines have become one of the most critical applications on the Web, driving many important online businesses that connect users to information. As the Web continues to grow its size with a variety of new data and penetrate into every aspect of our life, the need for developing a more intelligent search engine is increasing.The primary function of current Web search engines is essentially relevance ranking at the document level, an old paradigm in information retrieval for more than 25 years. To make web search more intelligent, Microsoft Research Asia is currently developing a set of technologies to enable searching at the object level. For example, when a user is looking for information about a researcher, the user is not interested in just retrieving a set of papers or documents in which this researcher's name appears, but more interested in finding insight and knowledge about this researcher as to what works he has done in different period of time, what important contributions he has brought to the research community, how influential he is, and his social networks, etc. Such kind of intelligence is not possible to obtain through current search engines.In this talk, I will present the technical problems that we need to address, including information extraction, object identification and integration, and object relationship mining and ranking. I will also show how we apply these technologies to build more advanced vertical search engines such as product search, academic search, and image search that provide users not only relevant search results but also intelligence and insights in the retrieved data.
Open source application spaces: 5th workshop on open source software engineering
Authors: Joseph Feller, Brian Fitzgerald, Scott Hissam, Karim Lakhani, Walt Scacchi
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Building on the success of the first four workshops in the series, which were held at ICSE 2001 (Toronto), ICSE 2002 (Orlando), ICSE 2003 (Portland) and ICSE 2004 (Edinburgh), the 5th Workshop on Open Source Software Engineering, ("Open Source Application Spaces") brought together researchers and practitioners for the purpose of building a roadmap of the ways in which various computing application spaces have been impacted by open source software and also by open source development methods, tools and organizational structures.
Improving Data Access for Computational Grid Applications
Authors: Ron Oldfield, David Kotz
Venue: Cluster Computing (2006)

High-performance computing increasingly occurs on "computational grids" composed of heterogeneous and geographically distributed systems of computers, networks, and storage devices that collectively act as a single "virtual" computer. A key challenge in this environment is to provide efficient access to data distributed across remote data servers. Our parallel I/O framework, called Armada, allows application and data-set providers to flexibly compose graphs of processing modules that describe the distribution, application interfaces, and processing required of the dataset before computation. Although the framework provides a simple programming model for the application programmer and the data-set provider, the resulting graph may contain bottlenecks that prevent efficient data access. In this paper, we present an algorithm used to restructure Armada graphs that distributes computation and data flow to improve performance in the context of a wide-area computational grid.
Parallel Programmer Productivity: A Case Study of Novice Parallel Programmers
Authors: Lorin Hochstein, Jeff Carver, Forrest Shull, Sima Asgari, Victor Basili
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

In developing High-Performance Computing (HPC) software, time to solution is an important metric. This metric is comprised of two main components: the human effort required developing the software, plus the amount of machine time required to execute it. To date, little empirical work has been done to study the first component: the human effort required and the effects of approaches and practices that may be used to reduce it. In this paper, we describe a series of studies that address this problem. We instrumented the development process used in multiple HPC classroom environments. We analyzed data within and across such studies, varying factors such as the parallel programming model used and the application being developed, to understand their impact on the development process.
Decentralized Workflow Modeling and Execution in Service-Oriented Computing Environment
Authors: Hongxin Li, Zhensu Lu
Venue: Proceedings of the IEEE International Workshop (2005)

In this paper, workflow management technology is used to achieve business process integration. The main idea is that the services provided by the business processes of an enterprise are implemented as corresponding workflow models, which can be considered to be "black-boxes", but can be subscribed and reused as sub-workflows by the service requestors in defining their own workflow models. The metamodel for supporting the proposed workflow modeling is given. The peer-to-peer interaction between workflow engines, the invoking of applications, and the monitoring and control of process instances can all be implemented as Web services. In order to endow this workflow management paradigm with more flexibility, multi-agent technology is used to perceive environment change, and to create adapted process definition through negotiation. Agents negotiate with KQML, but the communication is implemented with Web service model. The interfaces of the agents are defined with WSDL. KQML messages are mapped into SOAP messages.
A Floor Sensor System for Gait Recognition
Authors: Lee Middleton, Alex A. Buss, Alex Bazin, Mark S. Nixon
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

This paper describes the development of a prototype floor sensor as a gait recognition system. This could eventually find deployment as a standalone system (eg. a burglar alarm system) or as part of a multimodal biometric system. The new sensor consists of 1536 individual sensors arranged in a 3m by 0.5m rectangular strip with an individual sensor area of 3 cm2. The sensor floor operates at a sample rate of 22 Hz. The sensor itself uses a simple design inspired by computer keyboards and is made from low cost, off the shelf materials. Application of the sensor floor to a small database of 15 individuals was performed. Three features were extracted : stride length, stride cadence, and time on toe to time on heel ratio. Two of these measures have been used in video based gait recognition while the third is new to this analysis. These features proved sufficientto achieve an 80% recognition rate.
Is 1.7 x 10^10 Unknowns the Largest Finite Element System that Can Be Solved Today?
Authors: B Bergen, F. Hulsemann, U. Rude
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

The hierarchical hybrid Grids (HHG) framework attempts to remove limitations on the size of problem that can be solved using a finite element discretization of a partial differential equation (PDE) by using a process of regular refinement, of an unstructured input grid, to generate a nested hierarchy of patch-wise structured grids that is suitable for use with geometric multigrid. The regularity of the resulting grids may be exploited in such a way that it is no longer necessary to explicitly assemble the global discretization matrix. In particular, given an appropriate input grid, the discretization matrix may be defined implicitly using stencils that are constant for each structured patch. This drastically reduces the amonnt of memory required for the discretization, thus allowing for a much larger problem to be solved. Here we present a brief description of the HHG framework: detailing the principles that led to solving a finite element system with 1.7 x 10^10 unknowns, on an SGI Altix supercomputer, using 1024 nodes, with an overall performance of 0.96 TFLOP/s, on a logically unstructured grid, using geometric mmiltigrid as a solver.
Authors' comments on Miner and Caudell, ICAD 1997
Authors: Nadine E. Miner, Victor M. Vergara, Panaioti, Thomas Preston Caudell
Venue: ACM Transactions on Applied Perception (TAP) (2005)

Sound is a critical component of multimodal representations of information in virtual environments. Our research program continues to develop and evaluate sound software system architectures, localization techniques, sound synthesis, and musical sonification as tools to enhance human comprehension of complex data sets.
A profit maximizing distribution strategy for context-aware services
Authors: Thomas Buchholz, Iris Hochstatter, Claudia Linnhoff-Popien
Venue: Proceedings of the Second IEEE International Workshop on Mobile Commerce and Services (2005)

Large scale Mobile Commerce Applications need to be replicated and distributed to offer an appropriate quality of service to a large audience. In this context, a very important question is when and where replicas should be placed. In this article we present a new distribution strategy for applications in Content Delivery Networks (CDNs). It is intended to be used especially for Context-Aware Services (CAS). The main idea is to monetarily value the benefits that an additional replica gains at a certain location and to compare this value with the costs a replica causes. In this way, the replica's contribution to the overall profit is determined. A replica's profit is dependent on the number of requests it receives per time interval. Replicas are only placed at locations where the request rate is high enough to let the profit become positive. In order to react only to persistent and significant changes of the request rate, techniques from statistical process control are used. The new strategy is evaluated by simulation. The results suggest that it consumes significantly less storage and bandwidth than currently applied alternatives, while offering a comparable performance improvement for the clients.
Output-Nulling Subspaces, Zero Dynamics and Zeros in MIMO LTI Proper Systems
Authors: Jerzy Tokarzewski
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In linear time-invariant multi-input multi-output proper systems S(A,B,C,D) the classical notion of Smith zeros does not characterize fully the output-zeroing problem nor the zero dynamics. However, introducing the notion of invariant zeros (defined as those complex numbers for which there exists a zero direction with nonzero state-zero direction) which constitutes an extension of the concept of Smith zeros, the above disadvantage can be removed. Recall that Smith zeros of S(A,B,C,D) are the roots of the so-called zero polynomial which is obtained from the Smith canonical form of the underlying system matrix P(s), while the definition of invariant zeros admits an infinite number of these zeros (then the system is called degenerate). A simple sufficient and necessary condition of non-degeneracy (degeneracy) is presented. It decomposes the class of all systems S(A,B,C,D) such that D ≠ 0, C ≠ 0, B ≠ 0 into two disjoint subclasses: of degenerate and non-degenerate systems. In a non-degenerate system the Smith and invariant zeros are exactly the same objects which are the roots of the zero polynomial. The degree of this polynomial equals the dimension of the maximal output-nulling subspace, while the zero dynamics are determined fully by the Smith zeros. In a degenerate system the zero polynomial determines merely the Smith zeros, while the set of invariant zeros equals the whole complex plane. Moreover, the dimension of the maximal output-nulling subspace is strictly greater than the degree of the zero polynomial, and the zero dynamics are essentially dependent upon control vector.
Towards obstacle reconstruction through wide baseline set of images
Authors: Rimon Elias
Venue:  (2004)

In this thesis, we handle the problem of extracting 3D information from multiple images of a robotic work site in the context of teleoperation. A human operator determines the virtual path of a robotic vehicle and our mission is to provide him with the sequence of images that should be seen by the teleoperated robot moving along this path. The environment, in which the robotic vehicle moves, has a planar ground surface. In addition, a set of wide baseline images are available for the work site. This implies that a small number of points may be visible in more than two views. Moreover, camera parameters are known approximately. According to the sensor error margins, the parameters read lie within some range. Obstacles of different shapes are present in such an environment. In order to generate the sequence, this ground plane as well as the obstacles must be represented. The perspective image of the ground plane can be obtained through a homography matrix. This is done through the virtual camera parameters and the overhead view of the work site. In order to represent obstacles, we suggest different methods; these are volumetric and planar. Our algorithm to represent obstacles starts with detecting junctions. This is done through a new fast junction detection operator we propose. This operator provides the location of the junction as well as the orientations of the edges surrounding it. Junctions belonging to the obstacles are identified against those belonging to the ground plane through calculating the inter-image homography matrices. Fundamental matrices relating images can be estimated roughly through the available camera parameters. Strips surrounding epipolar lines are used as a search range for detecting possible matches. We introduce a novel homographic correlation method to be applied among candidates by reconstructing the planes of junctions in space. Two versions of homographic correlation are proposed; these are SAD and VNC. Both versions achieve matching results that outperform non-homographic correlation. The match set is then turned into a set of 3D points through triangulation. At this point, we propose a hierarchical structure to cluster points in space. This results in bounding boxes containing obstacles. A more accurate volumetric representation for the obstacle can be achieved through a voxelization approach. Another representation is suggested. That is to represent obstacles as planar patches. This is done through mapping among original and synthesized images. Finally, steps of the different algorithms presented throughout the thesis are supported by examples to show the usefulness we claim of our approaches.
Multilevel Distance Labelings for Paths and Cycles
Authors: Daphne Der-Fen Liu, Xuding Zhu
Venue: SIAM Journal on Discrete Mathematics (2005)

For a graph $G$, let $\diam(G)$ denote the diameter of $G$. For any two vertices $u$ and $v$ in $G$, let $d(u, v)$ denote the distance between $u$ and $v$. A multilevel distance labeling (or distance labeling) for $G$ is a function $f$ that assigns to each vertex of $G$ a nonnegative integer such that for any vertices $u$ and $v$, $|f(u)-f(v)| \geq \diam(G) - d_G(u, v) +1$. The span of $f$ is the largest number in $f(V)$. The radio number of $G$, denoted by $rn(G)$, is the minimum span of a distance labeling for $G$. In this paper, we completely determine the radio numbers for paths and cycles.
Patterns of Technology Use in Self-Directed Japanese Language Learning Projects and Implications for New Mobile Support Tools
Authors: Patricia Thornton, Mike Sharples
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper reports on an on-going, exploratory study to determine patterns of technology use in self-directed language learning, a study that will inform the creation of new mobile language learning support tools. A qualitative research approach involving six in-depth interviews was used to identify and document patterns of technology use. Emerging patterns are presented and implications for future mobile support tools are discussed.
Layered Routing in Irregular Networks
Authors: Olav Lysne
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Freedom from deadlock is a key issue in Cut-Through, Wormhole, and Store and Forward networks, and such freedom is usually obtained through careful design of the routing algorithm. Most existing deadlock-free routing methods for irregular topologies do, however, impose severe limitations on the available routing paths. We present a method called Layered Routing, which gives rise to a series of routing algorithms, some of which perform considerably better than previous ones. Our method groups virtual channels into network layers and to each layer it assigns a limited set of source/destination address pairs. This separation of traffic yields a significant increase in routing efficiency. We show how the method can be used to improve the performance of irregular networks, both through load balancing and by guaranteeing shortest-path routing. The method is simple to implement, and its application does not require any features in the switches other than the existence of a modest number of virtual channels. The performance of the approach is evaluated through extensive experiments within three classes of technologies. These experiments reveal a need for virtual channels as well as an improvement in throughput for each technology class.