ppxscal/embedding_network huggingface dataset:
Injection-locked clocking: a low-power clock distribution scheme for high-performance microprocessors
Authors: Lin Zhang, Aaron Carpenter, Berkehan Ciftcioglu, Alok Garg, Michael Huang, Hui Wu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

We propose injection-locked clocking (ILC) to combat deteriorating clock skew and jitter, and reduce power consumption in high-performance microprocessors. In the new clocking scheme, injection-locked oscillators are used as local clock receivers. Compared to conventional clocking with buffered trees or grids, ILC can achieve better power efficiency, lower jitter, and much simpler skew compensation thanks to its built-in deskewing capability. Unlike other alternatives, ILC is fully compatible with conventional clock distribution networks. In this paper, a quantitative study based on circuit and microarchitectural-level simulations is performed. Alpha21264 is used as the baseline processor, and is scaled to 0.13 µm and 3 GHz. Simulations show 20- and 23-ps jitter reduction, 10.1% and 17% power savings in two ILC configurations. A test chip distributing 5-GHz clock is implemented in a standard 0.18-µm CMOS technology and achieved excellent jitter performance and a deskew range up to 80 ps.
Cooperative Token-Ring Scheduling For Input-Queued Switches
Authors: Amir Gourgy, Ted H. Szymanski
Venue: IEEE Transactions on Computers (2009)

We present a novel distributed scheduling paradigm for Internet routers with input-queued (IQ) switches, called cooperative token-ring (CTR) that provides significant performance improvement over existing scheduling schemes with comparable complexity. Many classical schedulers for IQ switches employ round-robin arbiters, which can be viewed as non-cooperative token-rings, where a separate token is used to resolve contention for each shared resource (e.g., an output port) and each input port acquires a token oblivious of the state of other input ports. Although classical round-robin scheduling schemes achieve fairness and high throughput for uniform traffic, under non-uniform traffic the performance degrades significantly. We show that by using a simple cooperative mechanism between the otherwise non-cooperative arbiters, the performance can be significantly improved. The CTR scheduler dynamically adapts to non-uniform traffic patterns and achieves essentially 100% throughput. The proposed cooperative mechanism is conceptually simple and is supported by experimental results. To provide adequate support for rate guarantees in IQ switches, we present a weighted cooperative token-ring, a simple hierarchical scheduling mechanism. Finally, we analyze the hardware complexity introduced by the cooperative mechanism and describe an optimal hardware implementation for an N &#x00D7; N switch with time complexity of &#x0398;(log N) and circuit size of &#x0398;(N \\log N) per port.
Understanding consumer electronic (CE) product landscape through user experience assessment: a systematic approach
Authors: Sasanka Prabhala, Delia Grenville
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Many of the organizations, companies, and industries today are focusing on User Experience to differentiate themselves from competitors in the design and development of products, services, and/or applications. Intel Corporation which has primarily been a semi-conductor manufacturing company for a long time has shifted its focus to address the needs, desires, and expectations of users. The fundamental question to be answered is how to design and develop different products, services, and/or applications that add value to users and enhances their experiences. This paper addresses this fundamental question through a systematic approach of understanding the competitive landscape environment. The paper describes the results of the systematic approach in the context of consumer electronics (CE) domain and concludes with the benefits of understanding the competitive landscape environment.
Packet classification by multilevel cutting of the classification space: an algorithmic-architectural solution for IP packet classification in next generation networks
Authors: Motasem Aldiab, Emi Garcia-Palacios, Danny Crookes, Sakir Sezer
Venue: Journal of Computer Systems, Networks, and Communications (2008)

Traditionally, the Internet provides only a "best-effort" service, treating all packets going to the same destination equally. However, providing differentiated services for different users based on their quality requirements is increasingly becoming a demanding issue. For this, routers need to have the capability to distinguish and isolate traffic belonging to different flows. This ability to determine the flow each packet belongs to is called packet classification. Technology vendors are reluctant to support algorithmic solutions for classification due to their nondeterministic performance. Although content addressable memories (CAMs) are favoured by technology vendors due to their deterministic high-lookup rates, they suffer from the problems of high-power consumption and high-silicon cost. This paper provides a new algorithmic-architectural solution for packet classification that mixes CAMs with algorithms based on multilevel cutting of the classification space into smaller spaces. The provided solution utilizes the geometrical distribution of rules in the classification space. It provides the deterministic performance of CAMs, support for dynamic updates, and added flexibility for system designers.
Interference Games in Wireless Networks
Authors: Vincenzo Auletta, Luca Moscardelli, Paolo Penna, Giuseppe Persiano
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We present a game-theoretic approach to the study of scheduling communications in wireless networks and introduce and study a class of games that we call Interference Games. In our setting, a player can successfully transmit if it "shouts strongly enough"; that is, if her transmission power is sufficiently higher than all other (simultaneous) transmissions plus the environmental noise. This physical phenomenon is commonly known as the Signal-to-Interference-plus-Noise-Ratio (SINR).
A genetic-fuzzy mining approach for items with multiple minimum supports
Authors: Chun-Hao Chen, Tzung-Pei Hong, Vincent S. Tseng, Chang-Shing Lee
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2008)

Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Mining association rules from transaction data is most commonly seen among the mining techniques. Most of the previous mining approaches set a single minimum support threshold for all the items and identify the relationships among transactions using binary values. In the past, we proposed a genetic-fuzzy data-mining algorithm for extracting both association rules and membership functions from quantitative transactions under a single minimum support. In real applications, different items may have different criteria to judge their importance. In this paper, we thus propose an algorithm which combines clustering, fuzzy and genetic concepts for extracting reasonable multiple minimum support values, membership functions and fuzzy association rules from quantitative transactions. It first uses the k-means clustering approach to gather similar items into groups. All items in the same cluster are considered to have similar characteristics and are assigned similar values for initializing a better population. Each chromosome is then evaluated by the criteria of requirement satisfaction and suitability of membership functions to estimate its fitness value. Experimental results also show the effectiveness and the efficiency of the proposed approach.
Coordination in collective intelligence: the role of team structure and task interdependence
Authors: Aniket Kittur, Bryant Lee, Robert E. Kraut
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

The success of Wikipedia has demonstrated the power of peer production in knowledge building. However, unlike many other examples of collective intelligence, tasks in Wikipedia can be deeply interdependent and may incur high coordination costs among editors. Increasing the number of editors increases the resources available to the system, but it also raises the costs of coordination. This suggests that the dependencies of tasks in Wikipedia may determine whether they benefit from increasing the number of editors involved. Specifically, we hypothesize that adding editors may benefit low-coordination tasks but have negative consequences for tasks requiring a high degree of coordination. Furthermore, concentrating the work to reduce coordination dependencies should enable more efficient work by many editors. Analyses of both article ratings and article review comments provide support for both hypotheses. These results suggest ways to better harness the efforts of many editors in social collaborative systems involving high coordination tasks.
Research on Consumption Model about Urban Households Based on Keynes' Absolute Income Hypotheses in China
Authors: Junping Zhao
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

According to the absolute income hypotheses of J. M. Keynes, it constructed the consumption model of Chinese urban households by using the statistical data from 1990 to 2007, and studied the long-term equilibrium as well as short-term fluctuations between per capita annual living expenditure and annual per capita disposable income of urban households in China. The result of Granger causality test showed that the disposable income Granger caused the living expenditure. The result of cointegration test showed that there was a long-term stable equilibrium relationship between the living expenditure and disposable income. Marginal preference of consumption was 0.69. Spontaneous consumption was RMB 271.93 yuan. Error correction model showed that the short-term fluctuations of income levels had a significant positive effect on living expenditure. If the current consumption level has deviation from the long-term equilibrium value by RMB 1 yuan, it will be corrected by RMB 0.52 yuan next year.
A heuristic search approach to planning with temporally extended preferences
Authors: Jorge A. Baier, Fahiem Bacchus, Sheila A. McIlraith
Venue: Artificial Intelligence (2009)

Planning with preferences involves not only finding a plan that achieves the goal, it requires finding a preferred plan that achieves the goal, where preferences over plans are specified as part of the planner's input. In this paper we provide a technique for accomplishing this objective. Our technique can deal with a rich class of preferences, including so-called temporally extended preferences (TEPs). Unlike simple preferences which express desired properties of the final state achieved by a plan, TEPs can express desired properties of the entire sequence of states traversed by a plan, allowing the user to express a much richer set of preferences. Our technique involves converting a planning problem with TEPs into an equivalent planning problem containing only simple preferences. This conversion is accomplished by augmenting the inputed planning domain with a new set of predicates and actions for updating these predicates. We then provide a collection of new heuristics and a specialized search algorithm that can guide the planner towards preferred plans. Under some fairly general conditions our method is able to find a most preferred plan-i.e., an optimal plan. It can accomplish this without having to resort to admissible heuristics, which often perform poorly in practice. Nor does our technique require an assumption of restricted plan length or make-span. We have implemented our approach in the HPlan-P planning system and used it to compete in the 5th International Planning Competition, where it achieved distinguished performance in the Qualitative Preferences track.
An Efficient Broadcasting Scheme with Low Buffer Demand for Video-on-Demand Applications
Authors: Hsiang-Fu Yu, Chu-Yi Chien, Hung-Chang Yang, Yuan-Chieng Huang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

It has been well recognized as an efficient approach for broadcasting popular videos by partitioning a video data stream into multiple segments and launching each segment through an individual channel simultaneously and periodically. Based on the design premises, the fibonacci broadcasting (FiB) scheme allows a client with two-channel bandwidths to receive video segments. Extending FiB, this work designs a new FiB scheme (called FiB+) to achieve small buffering space as well as low bandwidth demand at the client. Extensive simulation was conducted, which demonstrated that FiB+ could have 30% smaller client buffer size than FiB.
EDP certification: is it necessary?
Authors: David R. Skeen
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

There is a movement afoot within the computer industry which will have a great impact on EDP personnel. Much literature has been published which concerns itself with EDP personnel certification. The formation of the Institute for Certification of Computer Professionals (ICCP) in August, 1973, has certainly triggered a large amount of discussion within the EDP community. In reality, everyone seems to be for certification and the prestigious distinction of being called "Professional." So it's everyone to the bandwagon! At a glance, it appears that our EDP certification bandwagon is charging ahead---the certification movement is straining at the harness, the bandwagon is creating dust clouds and recklessly moving forward and the computer passengers are frantically waving for forward motion. In essence, everything is moving forward except for one thing, the wheels---and they are going backwards, thus indicating that the certification base has not been firmly established. Is this the true posture of the EDP profession and its certification movement? Before proceeding with a grand and glorious certification program, it might be well at this time to ask a few important questions. One of which might be "Is EDP certification necessary?"
An object-oriented framework for virtual intelligent product manuals
Authors: Charilaos Pasantonopoulos, Stefan S. Dimov, Rossitza M. Setchi, Duc T. Pham
Venue: International Journal of Systems Science (2009)

In this article, an object-oriented framework for generation of electronic virtual technical manuals is presented. First, the generic problems of documentation generation are discussed. Then, the problems related to virtual documentation systems are presented. The lack of infrastructure and its effects on the documentation development cycle is analysed together with the complexity and the level of abstraction of virtual document generation techniques. The need for an object-oriented framework and virtual document generation techniques that increase the productivity and the flexibility of technical documentation, and ensure a better decision support is explained. Furthermore, the technologies enabling the development of systems for generating documentation are outlined, and the proposed system architecture is described together with a case study to illustrating it. Finally, the expected benefits of employing such object-oriented approach in developing product manuals are discussed.
Design of an interactive matrix calculator
Authors: Cleve Moler
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

MATLAB is an interactive computer program that serves as a convenient "laboratory" for computations involving matrices. It provides easy access to matrix software developed by the LINPACK and EISPACK projects [1--3]. The capabilities range from standard tasks such as solving simultaneous linear equations and inverting matrices, through symmetric and nonsymmetric eigenvalue problems, to fairly sophisticated matrix tools such as the singular value decomposition.
TEFE: A Time-Efficient Approach to Feature Extraction
Authors: Li-Ping Liu, Yang Yu, Yuan Jiang, Zhi-Hua Zhou
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

With the rapid evolution of internet applications, people all over the world are sharing pictures, videos and audios online, and thus, content-based analysis is often demanded. Test efficiency is crucial to the success of online information processing. One obstacle to high-speed testing is the time cost of feature extraction for test objects, particularly for objects with complex representation such as images, videos and audios. In this paper, we study the problem of reducing test time cost by extracting cheap but sufficient features. We propose the TEFE (Time-Efficient Feature Extraction) approach, which balances between the test accuracy and test time cost by extracting a proper subset of features for each test object. In the implementation, TEFE trains a sequence of support vector machines and classifies each test object cascadingly. Empirical study shows that TEFE is time efficient while holding a classification accuracy close to that of using all features. It also shows that the test time is linearly adjustable in TEFE.
Developing Topology Discovery in Event-B
Authors: Thai Son Hoang, Hironobu Kuruma, David Basin, Jean-Raymond Abrial
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges is specifying the problem itself. Our specification includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We establish these by appropriately combining proofs of invariant preservation, event refinement, event convergence, and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment.
Web Users' Personality Traits Analysis
Authors: Amiya K. Tripathy, Colton Gomes, Ashok Jain
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

Determining web users' personality traits plays a vital role in understanding user navigation patterns behaviours on the web. This information can then be used by various online firms to provide various personalized services to online customers. There are already numerous approaches towards analyzing user behavioural patterns. The client side tracking, server---side tracking, user remote tracker etc. are some of these. However all of them have certain inherent drawbacks which make them inappropriate for multi-user environments. We propose a new integrated approach and thereby develop a unique conceptual model which would prove to be extremely advantageous even in multi-user environments. We use user clicks to analyze the user behaviour along with the content on the various websites that the user visits. We also use a personality questionnaire which would help to further enhance our results and give a better understanding of the user's personality traits.
Partitioned n-detection test generation
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

We describe a method for improving the quality of <i>n</i>-detection test sets. Unlike earlier methods for achieving the same goal, the proposed method is based on the conventional definition of the number of detections and uses a conventional <i>n</i>-detection test generation process. Under the proposed method, the set of target faults is partitioned into two or more subsets. <i>n</i>-detection test generation is carried out for each subset separately. The resulting test sets are combined into a single test set. Partitioning causes more faults to be targeted directly, and fewer faults to be dropped due to accidental detection. The fault subsets can be selected based on detection conditions of common defects. In this work we partition the set of faults into a subset that consists of all the stuck-at 0 faults, and a subset that consists of all the stuck-at 1 faults. We demonstrate through experimental results that for the same test set size, partitioning the set of faults improves the coverage of untargeted faults (non-feedback four-way bridging faults) compared to <i>n</i>-detection test generation for the unpartitioned set of faults.
A versatile power conditioning technique for microsatellite applications
Authors: Keving Kyeon-il Choi, Alphonse Barnaba, Jean-Claude Llorens, Gérard Maral
Venue: Space Communications (1997)

For microsatellites, a versatile power supply sub-system is of paramount important. To maximize the power generated by the solar generators (SG), the Maximum Power Point Tracking (MPPT) technique is considered as a strong competitor to the conventional fixed shunt Pulse Width Modulation (PWM) technique. The paper presents an implementation based on a single power probing sensor associated with a micro-controller. The laboratory test shows that this MPPT controller functions correctly with few components. It is capable of controlling both SG Maximum Power Operation during battery charging period and Reduced Power Operation between battery charges. It is also possible to use the MPPT controller as a local telemetry controller.
Brief paper: Robustness of quantized control systems with mismatch between coder/decoder initializations
Authors: Tatiana Kameneva, Dragan Nešić
Venue: Automatica (Journal of IFAC) (2009)

This paper analyzes the stability of linear systems with quantized feedback in the presence of mismatch between the initial conditions at the coder and decoder. Under the assumption of the perfect channel, we show that using the scheme proposed in [Liberzon, D., & Nesic, D. (2007). Input-to-state stabilization of linear systems with quantized state measurements. Institute of Electrical and Electronic Engineers Transaction on Automatic Control, 52, 767-781] it is possible to achieve stability with exponential convergence of linear systems with quantized feedback when the coder and decoder are initialized at different initial conditions.
Institutional effects on the intention to adopt e-learning for business studies
Authors: Eric K. W. Lau
Venue: International Journal of Learning Technology (2009)

The present study investigates the factors that influence the adoption of e-learning among adult postgraduate university students in Hong Kong. In particular, the study addresses the question of whether institutional factors affect students' decision to adopt e-learning in their studies. A composite model of four constructs (perceived usefulness, perceived ease of use, perceived convenience and institutional effects) is proposed and tested in this quantitative survey of 125 part-time MBA students. The study finds that institutional effects and perceived convenience were the most important factors in a decision to adopt e-learning. The factors perceived usefulness and perceived ease of use did not have a significant relationship with the intention to adopt e-learning. The paper illustrates the theoretical and practical issues of social effects in the adoption of e-learning.