PICASSO: A graphical query language

PICASSO (PICture Aided Sophisticated Sketch Of database queries) is a graphics-based database query language designed for use with a universal relation database system. The primary objective of PICASSO is ease of use. Graphics are used to provide a simple method of expressing queries and to provide visual feedback to the user about the system's interpretation of the query. Inexperienced users can use the graphical feedback to aid them in formulating queries whereas experienced users can ignore the feedback. Inexperienced users can pose queries without knowing the details of underlying database schema and without learning the formal syntax of SQL-like query language. This paper presents the syntax of PICASSO queries and compares PICASSO queries with similar queries in standard relational query languages. Comparisons are also made with System/U, a non-graphical universal relation system on which PICASSO is based. The hypergraph semantics of the universal relation are used as the foundation for PICASSO and their integration with a graphical workstation enhances the usability of database systems.     

Cryptographic Hash Functions from Expander Graphs

We propose constructing provable collision resistant hash functions from expander graphs in which finding cycles is hard. As examples, we investigate two specific families of optimal expander graphs for provable collision resistant hash function constructions: the families of Ramanujan graphs constructed by Lubotzky-Phillips-Sarnak and Pizer respectively. When the hash function is constructed from one of Pizer’s Ramanujan graphs, (the set of supersingular elliptic curves over with ℓ-isogenies, ℓ a prime different from p), then collision resistance follows from hardness of computing isogenies between supersingular elliptic curves. For the LPS graphs, the underlying hard problem is a representation problem in group theory. Constructing our hash functions from optimal expander graphs implies that the outputs closely approximate the uniform distribution. This property is useful for arguing that the output is indistinguishable from random sequences of bits. We estimate the cost per bit to compute these hash functions, and we implement our hash function for several members of the Pizer and LPS graph families and give actual timings.     

Individual time-dependent spectral boundaries for improved accuracy in time-frequency analysis of heart rate variability

Heart rate variability (HRV) is a major noninvasive technique for evaluating the autonomic nervous system (ANS). Use of time-frequency approach to analyze HRV allows investigating the ANS behavior from the power integrals, as a function of time, in both steady-state and non steady-state. Power integrals are examined mainly in the low-frequency and the high-frequency bands. Traditionally, constant boundaries are chosen to determine the frequency bands of interest. However, these ranges are individual, and can be strongly affected by physiologic conditions (body position, breathing frequency). In order to determine the dynamic boundaries of the frequency bands more accurately, especially during autonomic challenges, we developed an algorithm for the detection of individual time-dependent spectral boundaries (ITSB). The ITSB was tested on recordings from a series of standard autonomic maneuvers with rest periods between them, and the response to stand was compared to the known physiological response. A major advantage of the ITSB is the ability to reliably define the mid-frequency range, which provides the potential to investigate the physiologic importance of this range.     

Efficient Biocatalytic Synthesis of (R)‐Pantolactone

Screening for stereoselective cyanohydrin synthesis in 96‐well plates was employed in the development of an efficient, pH‐stable hydroxynitrile lyase for the conversion of sterically hindered aliphatic aldehydes. Site‐saturation mutagenesis (SSM) resulted in a powerful catalyst for the stereoselective conversion of hydroxypivalaldehyde and pivalaldehyde to their corresponding (R)‐cyanohydrins (ee >97%) which are used as chiral building blocks (e.g., for pantothenic acid production). Furthermore, redesigning the PaHNL5 gene and improving its expression by Pichia pastoris with the help of a new P_AOX1 promoter variant and the helper protein PDI (protein disulfide isomerase) led to elevated amounts of today’s most efficient biocatalyst for vitamin B₅ synthesis.     

Enhanced efficiency and frequency assignment by optimizing the base stations location in a mobile radio network

Most mobile radio networks have been planned based on the classical cellular concept. However, alternative planning strategies that lead to more efficient network configurations are necessary due to the fact that the traffic density is generally far from constant throughout the service area, making necessary the relocation of base stations inside the traffic hotspots. If the traffic is characterized in a discrete way, the optimization of base stations location resembles vector quantization, a well-known problem in signal processing. In this paper, we use this analogy to propose a mobile radio network planning algorithm. Simulation results show that higher trunking efficiency as well as improved frequency assignment can be obtained if an existing mobile radio network is redesigned using the presented strategy. Raúl Chávez-Santiago was born in Oaxaca City, Mexico. He obtained the B.Sc. degree in communications and electronics engineering in 1997 from the School of Mechanical and Electrical Engineering (ESIME-IPN), and the M.Sc. degree in electrical engineering in 2001 from the Center of Research and Advanced Studies of the National Polytechnic Institute (CINVESTAV-IPN) in Mexico City. He has professional experience as Computer Networking Engineer, and Research and Teaching Assistant. Currently, he is completing his studies toward the Ph.D. degree at Ben-Gurion University (BGU) of the Negev, Israel. In 2002, he received the URSI Young Scientist Award. His main research interests are the optimal planning of radio communication networks, the electromagnetic compatibility of terrestrial and satellite radio systems, and the efficient use of the radio spectrum. He is an IEEE and IEICE student member, and a URSI radio scientist. Avi Raymond was born in Yavne, Israel. He received the B.Sc. and M.Sc. degrees in electrical engineering from Ben-Gurion University (BGU) of the Negev in 2000 and 2005, respectively. He worked for two years in a communication company in the field of Telephony and Broadband Services. He also worked as a Research Assistant in the communications laboratory at BGU. He currently works at Elta Electronic Industries Ltd. as System Engineer and pursues studies toward a second M.Sc. degree in systems engineering at the Technion Institute of Technology, Haifa, Israel. His research interests are the optimization algorithms for frequency assignment in cellular networks. Vladimir Lyandres was born in 1944, in Vologda, Russia. He received the M.Sc. degree in communications engineering in 1966 and the Ph.D. degree in communications theory in 1972 from the State University of Telecommunications (SUT), Saint Petersburg, Russia. He was with SUT until 1990 holding a position of Senior Scientific Associate and working on research and development of digital transmission systems, modeling of radio communication channels and algorithms of frequency planning for broadcasting and cellular systems. Since 1991 he holds a position of Researcher at the communications laboratory and Professor at the Department of Electrical and Computer Engineering, Ben-Gurion University (BGU) of the Negev, Israel. His research interests include synthesis of Markov models, combinatorial optimization, and adaptive power loading. He is a senior member of IEEE and member of IEICE.