ppxscal/embedding_network huggingface dataset:
Proceedings of the 2007 ACM workshop on Digital identity management
Venue: Workshop On Digital Identity Management (2007)

It is our great pleasure to welcome you to the Third ACM Workshop on Digital Identity Management -- DIM 2007. This year's symposium continues its tradition for being an important forum for exploring opportunities of, and issues with, digital identity. The aim of this year's workshop is to discuss and provide recommendations for the making implementable and deployable improvements to the usability of identity management by gathering vendors, users, and researchers, in the areas of identity management The call for papers attracted 26 submissions from Asia, Europe, Africa, and North America. The program committee accepted 10 papers that cover areas crossing over usability, privacy and security in authentication, reputation, and trust management. We hope that these proceedings will serve as a valuable reference for researchers and practitioners and facilitate further research and development in digital identity management.
Effects of temperature and size on contact behavior of self-assembled alkanethiol cluster for dip-pen nanolithography
Authors: Te-Hua Fang, Win-Jin Chang, Cheng-Da Wu
Venue: Microelectronic Engineering (2008)

Molecular dynamics (MD) calculations are used to study the contact behavior of self-assembled monolayer (SAM) deposited on gold substrate in dip-pen nanolithography (DPN). The interaction of SAM atoms was described by a general universal force field, the tight-binding, second-moment approximation was used for Au substrate, and the Lennard-Jones potential function was employed to describe interaction between the SAM and the Au substrate atoms. The MD model consists of a planar Au substrate with n-hexadecanethiol SAM chemisorbed to the substrate. When the SAM clusters are brought closer to the substrate surface, the interaction normal force is induced. The normal force increases as the size of SAM clusters increases. In addition, the effect of the temperature and the size of SAM clusters on the contact angle between the alkanethiol SAM and the Au substrate in DPN are evaluated. Results show that the contact angles decreased as the temperature increased, and the smaller the cluster size, the smaller the contact angle.
A Hybrid Genetic Algorithm for Solving Nonlinear Bilevel Programming Problems Based on the Simplex Method
Authors: Hecheng Li, Yuping Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, a hybrid genetic algorithm is proposed for solving nonlinear bilevel programming problems (BLPPs). In order to improve the feasibility of the individuals, for each fixed leader-level variable x, the follower's problem is solved to get its optimal solution y. Then, based on the simplex method, a new crossover operator is designed, in which the best individuals generated so far are employed to yield a good direction of evolvement. Furthermore, a penalty method is developed to deal with the leader-level constraints, in which the penalty parameter can be adjusted by considering the status of the individuals in the population. At last, when the follower's problem has more than one optimal solutions for a fixed x, a selection scheme is given by solving a constructed single-level programming problem. The simulation on 20 benchmark problems demonstrates the effectiveness of the proposed algorithm.
Identifying opportunities for exploiting cross-layer interactions in adaptive wireless systems
Authors: Troy Weingart, Douglas C. Sicker, Dirk Grunwald
Venue: Advances in Multimedia (2007)

The flexibility of cognitive and software-defined radio heralds an opportunity for researchers to reexamine how network protocol layers operate with respect to providing quality of service aware transmission among wireless nodes. This opportunity is enhanced by the continued development of spectrally responsive devices-ones that can detect and respond to changes in the radio frequency environment. Present wireless network protocols define reliability and other performance-related tasks narrowly within layers. For example, the frame size employed on 802.11 can substantially influence the throughput, delay, and jitter experienced by an application, but there is no simple way to adapt this parameter. Furthermore, while the data link layer of 802.11 provides error detection capabilities across a link, it does not specify additional features, such as forward error correction schemes, nor does it provide a means for throttling retransmissions at the transport layer (currently, the data link and transport layer can function counterproductively with respect to reliability). This paper presents an analysis of the interaction of physical, data link, and network layer parameters with respect to throughput, bit error rate, delay, and jitter. The goal of this analysis is to identify opportunities where system designers might exploit cross-layer interactions to improve the performance of Voice over IP (VoIP), instant messaging (IM), and file transfer applications.
On Bit Steering in the Minimization of the Control Memory of Microprogrammed Processors
Authors: N. N. Biswas
Venue: IEEE Transactions on Computers (1985)

The microcommands constituting the microprogram of the control memory of a microprogrammed processor can be partitioned into a number of disjoint sets. Some of these sets are then encoded to minimize the word width of the ROM storing the microprogram. A further reduction in the width of the ROM words can be achieved by a technique known as bit steering where one or more bits are shared by two or more sets of microcommands. These sets are called the steerable sets. This correspondence presents a simple method for the detection and encoding of steerable sets. It has been shown that the concurrency matrix of two steerable sets exhibits definite patterns of clusters which can be easily recognized. A relation "connection" has been defined which helps in the detection of three-set steerability. Once steerable sets are identified, their encoding becomes a straightforward procedure following the location of the identifying clusters on the concurrency matrix or matrices.
Flame Temperature Field Measurement Using Improved Generalized Cross Validation Method
Authors: Yinghui Zhou, Dezhong Zheng
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The image quality is a crucial factor for calculating flame temperature field based on the color CCD method. However, much unknown noise in flame images would prevent from obtaining the temperature with accuracy. To eliminate noise, the wavelet denoising with soft-threshold is considered to be effective. An important parameter for this procedure is threshold. For flame images containing much unknown noise, the paper presents using improved Generalized Cross Validation law to get optimal threshold (GCV- threshold). This procedure does not require prior knowledge of noise level and is proved to be asymptotically optimal. For comparing denoised effect, an artificial noisy image is processed by different thresholds. The results show the GCV threshold is superior to others. Furthermore, the method is applied into the industrial flame image which indicates the accuracy of the temperature measurement has been improved.
An Efficient Relational Decision Tree Classification Algorithm
Authors: Jing-Feng Guo, Jing Li, Wei-Feng Bian
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

We present a general approach to speeding up a family of multi-relational data mining algorithms that using ID propagation to obtain the information needed for building decision tree classifier from relational database. Preliminary results of our experiments suggest that the proposed method can yield 1-2 orders of magnitude reductions in the running time of such algorithms without any deterioration in the accuracy of results. The proposed modifications enhance the applicability of decision tree algorithms to significantly relational databases that would otherwise be not feasible in practice.
Morpheus: making routing programmable
Authors: Yi Wang, Ioannis Avramopoulos, Jennifer Rexford
Venue: Proceedings of the 2007 SIGCOMM workshop on Internet network management (2007)

This paper presents Morpheus, a modular, open routing platform that supports flexible control of routing policies of a network. With Morpheus, network operators can realize many useful policies that are infeasible today through composition of multiple policy modules and programming the route-selection algorithms. Morpheus can be readily deployed without requiring changes in other domains.
A Methodology for Finding Significant Network Hosts
Authors: DongJin Lee, Nevil Brownlee
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In recent years, much work has been done on observing and determining application types for network traffic flows. This is non-trivial because newer applications often encrypt their packets and do not use default port numbers. Also, application updates or protocol changes could vary the distributions of flow behaviors and patterns, resulting in complicated identification methods. We propose a different approach, in which we measure attribute values for hosts rather than flows to find significant hosts. We describe the attribute values that seem most useful in quantifying host behavior, and explain how we use an attribute sum to rank the hosts. Since host ranking does not rely on payload signatures or port numbers it is simple to implement, and can handle hosts running newly emerging applications and mixtures of applications. We suggest that hosts may be "significant in various ways'. For instance, they may have high traffic rates (busy servers), interaction with many other hosts (p2p behaviors) or initiate many unidirectional flows (malicious behaviors). Further, they may change their behaviors over time (compromised hosts). We compute a set of host rankings at 60s intervals so as to observe changes in them.
Sensor network programming with Flask
Authors: Geoffrey Mainland, Greg Morrisett, Matt Welsh, Ryan Newton
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

A great deal of recent work has investigated new programming abstractions and models for sensor networks. However, the complexity of such systems demands a great deal of effort to develop appropriate compilers and runtime platforms to achieve good performance. We will demonstrate Flask [5], a new programming platform for sensor networks that decouples the design of a high-level programming environment from the the low-level details of generating per-node code and an efficient runtime system.
Matrix Method for Principal Normal Form of Propositional Formula
Authors: Wang Ting-ming, Wang Aiqing
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A matrix method for principal normal form of propositional formula is derived from disjunctive normal form and conjunctive normal form based on the extension principle and deletion principle of superscript vectors of simplified phrase and simplified clause. Calculation process of principal normal form with equivalent calculus or truth table is simplified by the method presented.
Bluetooth: vision, goals, and architecture
Authors: Jaap Haartsen, Mahmoud Naghshineh, Jon Inouye, Olaf J. Joeressen, Warren Allen
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1998)

A few years ago it was recognized that the vision of a truly low-cost, low-power radio-based cable replacement was feasible. Such a ubiquitous link would provide the basis for portable devices to communicate together in an ad hoc fashion by creating personal area networks which have similar advantages to their office environment counterpart - the local area network (LAN). Bluetooth is an effort by a consortium of companies to design a royalty free technology specification enabling this vision. This article describes the vision and goals of the Bluetooth program and introduces the radio-based technology.
Alleviating communication challenges in film scoring: an interaction design approach
Authors: Julien Phalip, Matthew Morphett, Ernest Edmonds
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Film Scoring is a creative and collaborative activity that involves several practitioners, in particular music specialists (film composers) and non specialists (filmmakers). These practitioners face recurrent challenges in communication primarily because they do not share the same musical language. In this paper we present the results of research undertaken into the communication process between filmmakers and composers, with particular focus on the challenges experienced by the two parties. We then propose and discuss an interaction design approach to progress towards appropriate computer-based solutions.
The computer in teaching: ten widely believed myths
Authors: Alfred M. Bork
Venue: ACM SIGCUE Outlook (1973)

The following remarks were made by the author at the SIGUCC meeting which followed immediately upon the Fourth Conference on Computers in Undergraduate Curricula, held in Claremont in June.
Energy-Efficient Power Control Game for Cognitive Radio Systems
Authors: Shilun Cheng, Zhen Yang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

We consider the communication needs of cognitive radios, in order to ensure the unimpaired operation of licensed users and secondary users' communications isn't intermitted. This paper proposes a STBC MCCDMA cognitive radio systems and a hand-off technique for secondary users. We design a novel power control game algorithm named NCPG to efficiently use spectrum resources. Simulation results show that our algorithm can meet the different SIR requirements and yields significant improvement in throughput under the same power consumption.
Rapidly implementing languages to compile as C++ without crafting a compiler
Authors: Anthony Savidis
Venue: Software&mdash;Practice Experience (2007)

We present a heuristic implementation method for programming languages that is appropriate when the following requirements or conditions are met: (a) there is a need for very rapid development of a language with significant performance demands, while exploiting a comprehensive host language and-or library; (b) need of customized runtime execution environment supporting of execution tracing and visualization instruments; (c) the facilitation of hybrid code exists, such as mixing with the native language, and there is the potential for allowing multiple languages to be deployed concurrently in the same program. This may account for a wide range of domain-specific languages such as learning-oriented, scripting, assembly style, data manipulation, rule-based, or event languages. The proposed technique is presented for the C++ language, supporting the development of languages whose source programs compile as C++ code. The software architecture shifts from the tradition of lexical analysis, syntax-directed translation and code generation, and we propose a complementary, conditionally advantageous, heuristic development paradigm. The method has been applied to the development of a high-level imperative language, an assembly language and a functional language, which are all currently deployed for teaching purposes. Copyright &copy; 2007 John Wiley & Sons, Ltd.
Lightweight web-based fact repositories for textual question answering
Authors: Marius Paşca
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Since answers to fact-seeking questions usually reside within small factual text nuggets, often "hidden" within full-length documents, their relevance to a question is not necessarily correlated to the relevance of the full-length document to the question. Yet previous approaches to open-domain textual question answering from large document collections quasi-unanimously employ a document retrieval stage, in order to apply widely different, often expensive answer mining techniques to only a small subset of documents. Depending on the collection size, 95% or more of the documents in the collection (much more in the case of the Web) are left out of the selected subset for any given query, and thus become invisible to subsequent processing stages for actual answer mining. This paper introduces a new model for answer retrieval for question answering. The collection is distilled offline into large repositories of facts. Each fact constitutes a potential direct answer to questions seeking a particular kind of entity or relation, such as questions asking about the date of particular events. Question answering becomes equivalent to online fact retrieval, which greatly simplifies the de-facto system architecture for fact-seeking question answering. In addition to simplicity, experiments on a fact repository acquired from approximately a billion Web documents illustrate the impact of fact repositories in extracting accurate answers to a standard evaluation set of open-domain test questions and additional sets of domain-specific questions.
PCR-Tree: A Compression-Based Index Structure for Similarity Searching in High-Dimensional Image Databases
Authors: Jiangtao Cui, Shuisheng Zhou, Shan Zhao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The vector approximation file (VA-file) approach is an efficient high-dimensional indexing method using compression technique to overcome the difficulty of `curse of dimensionality'. The VA-file method combined with tree-based index structure can improve the querying efficiency, but it still succumbs to the `curse of dimensionality'. In this paper, a new high-dimensional indexing structure called PCR-tree for non-uniform distributed data sets was presented, which employs R-tree to manage the approximate vectors in the reduced- dimensionality space. The approximate vectors can be built in the KL transform domain, and low dimensional MBRs (minimum bounding rectangles) can be used to manage the approximations on the first few principal components. When performing k -nearest neighbor search, a lower-bound filtering algorithm is used to reject the improper nodes of PCR-tree, which can reduce the computational complexity and I/O cost without any dismissals. The experiment results on large image databases show that the new approach provides a faster search speed than other tree-structured vector approximation approaches.
Mining redundancy in candidate-bearing snippets to improve web question answering
Authors: Youzheng Wu, Xinhui Hu, Hideki Kashioka
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Conventional question answering (QA) techniques independently process candidate-bearing snippets to select an exact answer to a question from candidate answers. This paper presents two novel ways of utilizing redundancy in candidate-bearing snippets to help select an exact answer to a question in our Web QA system, i.e., cluster-based language model (CLM-M) and unsupervised SVM classifier (U-SVM) techniques. The comparative experiments demonstrate that the proposed methods significantly outperform the language model-based (LM-M) and supervised SVM-based (S-SVM) techniques that do not utilize this redundancy in the candidate-bearing snippets. Using the CLM-M, the top_1 score is increased from 36.03% (LM-M) to 46.96%; and the top_1 improvement in the U-SVM over the S-SVM is about 23%. Moreover, a cross-model comparison shows that the performance ranking of these models is: U-SVM > CLM-LM > LM-M > S-SVM > R-M (the retrieval-based model).
Towards A Service-Oriented Architecture for Demand-Driven e Government
Authors: Marc M. Lankhorst
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

This paper describes the requirements and high-level design of a service-oriented architecture for demand- driven e-government. Central to this architecture is the integration of services from different government agencies and private parties to create truly demand- driven e-services to citizens. Starting from a descrip- tion of the requirements, we give a functional architec- ture and identify technologies that may be used to realize this functionality. This architecture is the first to combine service orientation, identity management, business process management, and semantic web tech- nologies to implement this vision of integrated, de- mand-driven services.
From External to Internal Regret
Authors: Avrim Blum, Yishay Mansour
Venue: The Journal of Machine Learning Research (2007)

External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares the loss of an online algorithm to the loss of a modified online algorithm, which consistently replaces one action by another. In this paper we give a simple generic reduction that, given an algorithm for the external regret problem, converts it to an efficient online algorithm for the internal regret problem. We provide methods that work both in the full information model, in which the loss of every action is observed at each time step, and the partial information (bandit) model, where at each time step only the loss of the selected action is observed. The importance of internal regret in game theory is due to the fact that in a general game, if each player has sublinear internal regret, then the empirical frequencies converge to a correlated equilibrium. For external regret we also derive a quantitative regret bound for a very general setting of regret, which includes an arbitrary set of modification rules (that possibly modify the online algorithm) and an arbitrary set of time selection functions (each giving different weight to each time step). The regret for a given time selection and modification rule is the difference between the cost of the online algorithm and the cost of the modified online algorithm, where the costs are weighted by the time selection function. This can be viewed as a generalization of the previously-studied sleeping experts setting.
Shift-register-based data transposition for cost-effective discrete cosine transform
Authors: Shih-Chang Hsia, Szu-Hong Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents a cost-effective 2-D-discrete cosine transform (DCT) architecture based on the fast row/column decomposition algorithm. We propose a new schedule for 2-D-DCT computing to reduce the hardware cost. With this approach, the transposed memory can be simplified using shift-registers for the data transposition between two 1-D-DCT units. A special shift cell with MOS circuit is designed by using the energy transferring methodology. The memory size can be greatly reduced, and the address generator and its READ/WRITE control all can be saved. For an 8 × 8-block transformation, the number of transistors is only 4 k for the shift-register array. The maximum frequency of shift-operation can achieve about 120 MHz, when implemented by 0.35-µm technology.